./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:44:20,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:44:20,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:44:20,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:44:20,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:44:20,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:44:20,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:44:20,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:44:20,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:44:20,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:44:20,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:44:20,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:44:20,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:44:20,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:44:20,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:44:20,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:44:20,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:44:20,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:44:20,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:44:20,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:44:20,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:44:20,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:44:20,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:44:20,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:44:20,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:44:20,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:44:20,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:44:20,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:44:20,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:44:20,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:44:20,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:44:20,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:44:20,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:44:20,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:44:20,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:44:20,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:44:20,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:44:20,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:44:20,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:44:20,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:44:20,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:44:20,711 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-15 22:44:20,725 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:44:20,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:44:20,727 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:44:20,728 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:44:20,728 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:44:20,728 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:44:20,729 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:44:20,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:44:20,729 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:44:20,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:44:20,730 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:44:20,730 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:44:20,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:44:20,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:44:20,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:44:20,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 22:44:20,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:44:20,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 22:44:20,731 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 22:44:20,731 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:44:20,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 22:44:20,731 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:44:20,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 22:44:20,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:44:20,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:44:20,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:44:20,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:44:20,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:44:20,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:44:20,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 22:44:20,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:44:20,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:44:20,733 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:44:20,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 22:44:20,733 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:44:20,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:44:20,733 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:44:20,734 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c [2023-02-15 22:44:20,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:44:20,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:44:20,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:44:20,967 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:44:20,967 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:44:20,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-2.i [2023-02-15 22:44:21,912 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:44:22,080 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:44:22,080 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i [2023-02-15 22:44:22,090 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5798305e7/e4d003870635416297d591f908297692/FLAG2a26a8293 [2023-02-15 22:44:22,103 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5798305e7/e4d003870635416297d591f908297692 [2023-02-15 22:44:22,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:44:22,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:44:22,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:44:22,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:44:22,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:44:22,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:44:22" (1/1) ... [2023-02-15 22:44:22,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee07b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:44:22, skipping insertion in model container [2023-02-15 22:44:22,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:44:22" (1/1) ... [2023-02-15 22:44:22,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:44:22,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:44:22,240 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i[1168,1181] [2023-02-15 22:44:22,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:44:22,279 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:44:22,287 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i[1168,1181] [2023-02-15 22:44:22,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:44:22,312 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:44:22,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:44:22 WrapperNode [2023-02-15 22:44:22,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:44:22,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:44:22,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:44:22,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:44:22,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:44:22" (1/1) ... [2023-02-15 22:44:22,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:44:22" (1/1) ... [2023-02-15 22:44:22,359 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 182 [2023-02-15 22:44:22,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:44:22,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:44:22,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:44:22,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:44:22,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:44:22" (1/1) ... [2023-02-15 22:44:22,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:44:22" (1/1) ... [2023-02-15 22:44:22,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:44:22" (1/1) ... [2023-02-15 22:44:22,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:44:22" (1/1) ... [2023-02-15 22:44:22,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:44:22" (1/1) ... [2023-02-15 22:44:22,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:44:22" (1/1) ... [2023-02-15 22:44:22,391 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:44:22" (1/1) ... [2023-02-15 22:44:22,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:44:22" (1/1) ... [2023-02-15 22:44:22,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:44:22,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:44:22,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:44:22,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:44:22,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:44:22" (1/1) ... [2023-02-15 22:44:22,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:44:22,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:44:22,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 22:44:22,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 22:44:22,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:44:22,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:44:22,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:44:22,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:44:22,519 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:44:22,520 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:44:22,898 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:44:22,903 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:44:22,906 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 22:44:22,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:22 BoogieIcfgContainer [2023-02-15 22:44:22,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:44:22,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:44:22,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:44:22,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:44:22,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:44:22" (1/3) ... [2023-02-15 22:44:22,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d923a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:44:22, skipping insertion in model container [2023-02-15 22:44:22,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:44:22" (2/3) ... [2023-02-15 22:44:22,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d923a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:44:22, skipping insertion in model container [2023-02-15 22:44:22,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:22" (3/3) ... [2023-02-15 22:44:22,918 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2023-02-15 22:44:22,932 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:44:22,933 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-02-15 22:44:22,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:44:22,981 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7e611426, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:44:22,982 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-02-15 22:44:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 22:44:22,988 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:22,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 22:44:22,989 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:22,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2023-02-15 22:44:22,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:22,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551384904] [2023-02-15 22:44:22,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:22,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:23,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:44:23,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:23,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551384904] [2023-02-15 22:44:23,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551384904] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:44:23,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:44:23,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 22:44:23,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458335382] [2023-02-15 22:44:23,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:44:23,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 22:44:23,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:23,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 22:44:23,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:44:23,127 INFO L87 Difference]: Start difference. First operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:23,144 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2023-02-15 22:44:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 22:44:23,147 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-15 22:44:23,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:23,153 INFO L225 Difference]: With dead ends: 153 [2023-02-15 22:44:23,153 INFO L226 Difference]: Without dead ends: 76 [2023-02-15 22:44:23,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:44:23,157 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:23,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:44:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-15 22:44:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-15 22:44:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2023-02-15 22:44:23,186 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 4 [2023-02-15 22:44:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:23,187 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2023-02-15 22:44:23,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2023-02-15 22:44:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:44:23,189 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:23,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:23,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:44:23,190 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:23,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:23,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1140047638, now seen corresponding path program 1 times [2023-02-15 22:44:23,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:23,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324517666] [2023-02-15 22:44:23,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:23,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:44:23,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:23,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324517666] [2023-02-15 22:44:23,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324517666] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:44:23,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:44:23,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:44:23,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903245086] [2023-02-15 22:44:23,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:44:23,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:44:23,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:23,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:44:23,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:44:23,333 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:23,451 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2023-02-15 22:44:23,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:44:23,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 22:44:23,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:23,453 INFO L225 Difference]: With dead ends: 162 [2023-02-15 22:44:23,453 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 22:44:23,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:44:23,454 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:23,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 139 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:44:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 22:44:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-02-15 22:44:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2023-02-15 22:44:23,462 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 17 [2023-02-15 22:44:23,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:23,463 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2023-02-15 22:44:23,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2023-02-15 22:44:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 22:44:23,466 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:23,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:23,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:44:23,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:23,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:23,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1047629272, now seen corresponding path program 1 times [2023-02-15 22:44:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:23,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136059700] [2023-02-15 22:44:23,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:23,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:44:23,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:23,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136059700] [2023-02-15 22:44:23,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136059700] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:44:23,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:44:23,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:44:23,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613451440] [2023-02-15 22:44:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:44:23,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:44:23,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:23,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:44:23,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:44:23,634 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:23,792 INFO L93 Difference]: Finished difference Result 268 states and 359 transitions. [2023-02-15 22:44:23,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:44:23,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 22:44:23,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:23,797 INFO L225 Difference]: With dead ends: 268 [2023-02-15 22:44:23,797 INFO L226 Difference]: Without dead ends: 194 [2023-02-15 22:44:23,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:44:23,803 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 147 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:23,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 336 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:44:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-15 22:44:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 117. [2023-02-15 22:44:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 116 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 154 transitions. [2023-02-15 22:44:23,821 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 154 transitions. Word has length 24 [2023-02-15 22:44:23,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:23,822 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 154 transitions. [2023-02-15 22:44:23,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:23,822 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 154 transitions. [2023-02-15 22:44:23,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 22:44:23,823 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:23,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:23,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:44:23,824 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:23,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:23,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1685366660, now seen corresponding path program 1 times [2023-02-15 22:44:23,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:23,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911054754] [2023-02-15 22:44:23,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:23,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:44:23,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:23,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911054754] [2023-02-15 22:44:23,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911054754] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:44:23,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:44:23,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:44:23,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932211005] [2023-02-15 22:44:23,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:44:23,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:44:23,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:23,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:44:23,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:44:23,904 INFO L87 Difference]: Start difference. First operand 117 states and 154 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:23,908 INFO L93 Difference]: Finished difference Result 192 states and 255 transitions. [2023-02-15 22:44:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:44:23,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 22:44:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:23,909 INFO L225 Difference]: With dead ends: 192 [2023-02-15 22:44:23,909 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 22:44:23,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:44:23,910 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 91 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:23,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 92 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:44:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 22:44:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-15 22:44:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2023-02-15 22:44:23,915 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 27 [2023-02-15 22:44:23,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:23,915 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2023-02-15 22:44:23,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2023-02-15 22:44:23,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 22:44:23,916 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:23,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:23,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:44:23,916 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:23,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1440594285, now seen corresponding path program 1 times [2023-02-15 22:44:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:23,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303691885] [2023-02-15 22:44:23,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:23,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:44:24,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:24,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303691885] [2023-02-15 22:44:24,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303691885] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:44:24,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:44:24,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:44:24,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679752925] [2023-02-15 22:44:24,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:44:24,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:44:24,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:24,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:44:24,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:44:24,048 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:24,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:24,163 INFO L93 Difference]: Finished difference Result 233 states and 313 transitions. [2023-02-15 22:44:24,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:44:24,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-15 22:44:24,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:24,165 INFO L225 Difference]: With dead ends: 233 [2023-02-15 22:44:24,165 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 22:44:24,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:44:24,168 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 126 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:24,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 295 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:44:24,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 22:44:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 101. [2023-02-15 22:44:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.3) internal successors, (130), 100 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2023-02-15 22:44:24,182 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 33 [2023-02-15 22:44:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:24,182 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2023-02-15 22:44:24,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2023-02-15 22:44:24,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 22:44:24,183 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:24,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:24,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:44:24,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:24,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:24,187 INFO L85 PathProgramCache]: Analyzing trace with hash -884064914, now seen corresponding path program 1 times [2023-02-15 22:44:24,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:24,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911663828] [2023-02-15 22:44:24,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:44:24,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:24,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911663828] [2023-02-15 22:44:24,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911663828] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:44:24,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099999784] [2023-02-15 22:44:24,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:24,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:44:24,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:44:24,274 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:44:24,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 22:44:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:24,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:44:24,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:44:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:44:24,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:44:24,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099999784] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:44:24,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:44:24,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-02-15 22:44:24,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031871438] [2023-02-15 22:44:24,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:44:24,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:44:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:24,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:44:24,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:44:24,456 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:24,572 INFO L93 Difference]: Finished difference Result 210 states and 302 transitions. [2023-02-15 22:44:24,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:44:24,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 22:44:24,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:24,573 INFO L225 Difference]: With dead ends: 210 [2023-02-15 22:44:24,573 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 22:44:24,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:44:24,574 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 54 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:24,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 164 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:44:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 22:44:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2023-02-15 22:44:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:24,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2023-02-15 22:44:24,597 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 36 [2023-02-15 22:44:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:24,597 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2023-02-15 22:44:24,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:24,598 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2023-02-15 22:44:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:44:24,602 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:24,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:24,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 22:44:24,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 22:44:24,808 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash -71033840, now seen corresponding path program 1 times [2023-02-15 22:44:24,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:24,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465264422] [2023-02-15 22:44:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:24,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:44:24,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:24,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465264422] [2023-02-15 22:44:24,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465264422] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:44:24,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112507229] [2023-02-15 22:44:24,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:24,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:44:24,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:44:24,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:44:24,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 22:44:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:24,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:44:24,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:44:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:44:25,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:44:25,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112507229] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:44:25,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:44:25,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-15 22:44:25,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214977414] [2023-02-15 22:44:25,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:44:25,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:44:25,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:25,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:44:25,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:44:25,080 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:25,134 INFO L93 Difference]: Finished difference Result 246 states and 325 transitions. [2023-02-15 22:44:25,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:44:25,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 22:44:25,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:25,135 INFO L225 Difference]: With dead ends: 246 [2023-02-15 22:44:25,135 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 22:44:25,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:44:25,137 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 87 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:25,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 123 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:44:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 22:44:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2023-02-15 22:44:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.2619047619047619) internal successors, (159), 126 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 159 transitions. [2023-02-15 22:44:25,143 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 159 transitions. Word has length 43 [2023-02-15 22:44:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:25,144 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 159 transitions. [2023-02-15 22:44:25,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 159 transitions. [2023-02-15 22:44:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 22:44:25,145 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:25,146 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:25,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 22:44:25,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-02-15 22:44:25,352 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:25,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1390557187, now seen corresponding path program 1 times [2023-02-15 22:44:25,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:25,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421977888] [2023-02-15 22:44:25,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:25,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:44:25,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:25,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421977888] [2023-02-15 22:44:25,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421977888] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:44:25,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276186096] [2023-02-15 22:44:25,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:25,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:44:25,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:44:25,533 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:44:25,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 22:44:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:25,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:44:25,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:44:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 22:44:25,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:44:25,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276186096] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:44:25,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:44:25,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-02-15 22:44:25,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627146722] [2023-02-15 22:44:25,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:44:25,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:44:25,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:25,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:44:25,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:44:25,630 INFO L87 Difference]: Start difference. First operand 127 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:25,728 INFO L93 Difference]: Finished difference Result 283 states and 380 transitions. [2023-02-15 22:44:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:44:25,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-02-15 22:44:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:25,729 INFO L225 Difference]: With dead ends: 283 [2023-02-15 22:44:25,729 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 22:44:25,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:44:25,731 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:25,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 197 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:44:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 22:44:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 149. [2023-02-15 22:44:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.25) internal successors, (185), 148 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 185 transitions. [2023-02-15 22:44:25,734 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 185 transitions. Word has length 52 [2023-02-15 22:44:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:25,735 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 185 transitions. [2023-02-15 22:44:25,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 185 transitions. [2023-02-15 22:44:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-15 22:44:25,736 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:25,736 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:25,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:44:25,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:44:25,941 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:25,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:25,941 INFO L85 PathProgramCache]: Analyzing trace with hash 360401152, now seen corresponding path program 1 times [2023-02-15 22:44:25,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:25,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773908289] [2023-02-15 22:44:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:25,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:44:26,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:26,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773908289] [2023-02-15 22:44:26,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773908289] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:44:26,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693223740] [2023-02-15 22:44:26,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:26,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:44:26,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:44:26,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:44:26,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 22:44:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:26,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:44:26,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:44:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 22:44:26,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:44:26,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693223740] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:44:26,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:44:26,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-02-15 22:44:26,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988732434] [2023-02-15 22:44:26,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:44:26,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:44:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:26,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:44:26,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:44:26,216 INFO L87 Difference]: Start difference. First operand 149 states and 185 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:26,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:26,317 INFO L93 Difference]: Finished difference Result 327 states and 431 transitions. [2023-02-15 22:44:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:44:26,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-02-15 22:44:26,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:26,318 INFO L225 Difference]: With dead ends: 327 [2023-02-15 22:44:26,318 INFO L226 Difference]: Without dead ends: 191 [2023-02-15 22:44:26,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:44:26,319 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 42 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:26,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 199 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:44:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-15 22:44:26,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 171. [2023-02-15 22:44:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.2411764705882353) internal successors, (211), 170 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 211 transitions. [2023-02-15 22:44:26,322 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 211 transitions. Word has length 68 [2023-02-15 22:44:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:26,323 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 211 transitions. [2023-02-15 22:44:26,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2023-02-15 22:44:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-02-15 22:44:26,323 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:26,323 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:26,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:44:26,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:44:26,524 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:26,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash 629870863, now seen corresponding path program 1 times [2023-02-15 22:44:26,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:26,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335287291] [2023-02-15 22:44:26,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:26,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-15 22:44:26,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:26,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335287291] [2023-02-15 22:44:26,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335287291] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:44:26,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:44:26,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:44:26,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272220718] [2023-02-15 22:44:26,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:44:26,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:44:26,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:26,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:44:26,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:44:26,656 INFO L87 Difference]: Start difference. First operand 171 states and 211 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:26,847 INFO L93 Difference]: Finished difference Result 645 states and 803 transitions. [2023-02-15 22:44:26,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:44:26,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2023-02-15 22:44:26,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:26,849 INFO L225 Difference]: With dead ends: 645 [2023-02-15 22:44:26,849 INFO L226 Difference]: Without dead ends: 501 [2023-02-15 22:44:26,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:44:26,849 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 229 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:26,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 478 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:44:26,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-02-15 22:44:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 171. [2023-02-15 22:44:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.2411764705882353) internal successors, (211), 170 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 211 transitions. [2023-02-15 22:44:26,854 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 211 transitions. Word has length 84 [2023-02-15 22:44:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:26,854 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 211 transitions. [2023-02-15 22:44:26,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:26,855 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2023-02-15 22:44:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-15 22:44:26,855 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:26,855 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:26,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 22:44:26,855 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:26,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:26,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2117430847, now seen corresponding path program 1 times [2023-02-15 22:44:26,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:26,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704506897] [2023-02-15 22:44:26,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:26,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-15 22:44:26,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:26,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704506897] [2023-02-15 22:44:26,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704506897] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:44:26,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:44:26,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:44:26,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862983402] [2023-02-15 22:44:26,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:44:26,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:44:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:26,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:44:26,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:44:26,979 INFO L87 Difference]: Start difference. First operand 171 states and 211 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:27,222 INFO L93 Difference]: Finished difference Result 815 states and 1013 transitions. [2023-02-15 22:44:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:44:27,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2023-02-15 22:44:27,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:27,225 INFO L225 Difference]: With dead ends: 815 [2023-02-15 22:44:27,225 INFO L226 Difference]: Without dead ends: 671 [2023-02-15 22:44:27,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:44:27,225 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 343 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:27,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 640 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:44:27,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2023-02-15 22:44:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 171. [2023-02-15 22:44:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.2411764705882353) internal successors, (211), 170 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 211 transitions. [2023-02-15 22:44:27,232 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 211 transitions. Word has length 87 [2023-02-15 22:44:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:27,232 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 211 transitions. [2023-02-15 22:44:27,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2023-02-15 22:44:27,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-15 22:44:27,232 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:27,233 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:27,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 22:44:27,233 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:27,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:27,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1885697052, now seen corresponding path program 1 times [2023-02-15 22:44:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:27,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916084680] [2023-02-15 22:44:27,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:27,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 22:44:27,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:27,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916084680] [2023-02-15 22:44:27,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916084680] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:44:27,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952626656] [2023-02-15 22:44:27,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:27,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:44:27,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:44:27,379 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:44:27,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 22:44:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:27,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:44:27,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:44:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-15 22:44:27,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:44:27,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952626656] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:44:27,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:44:27,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-02-15 22:44:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785125233] [2023-02-15 22:44:27,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:44:27,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:44:27,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:27,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:44:27,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:44:27,529 INFO L87 Difference]: Start difference. First operand 171 states and 211 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:27,601 INFO L93 Difference]: Finished difference Result 469 states and 583 transitions. [2023-02-15 22:44:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:44:27,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2023-02-15 22:44:27,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:27,603 INFO L225 Difference]: With dead ends: 469 [2023-02-15 22:44:27,603 INFO L226 Difference]: Without dead ends: 325 [2023-02-15 22:44:27,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:44:27,604 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 68 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:27,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 227 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:44:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-02-15 22:44:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 308. [2023-02-15 22:44:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.250814332247557) internal successors, (384), 307 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 384 transitions. [2023-02-15 22:44:27,613 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 384 transitions. Word has length 87 [2023-02-15 22:44:27,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:27,614 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 384 transitions. [2023-02-15 22:44:27,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 384 transitions. [2023-02-15 22:44:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-15 22:44:27,615 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:27,615 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:27,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:44:27,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 22:44:27,819 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:27,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:27,820 INFO L85 PathProgramCache]: Analyzing trace with hash -312709955, now seen corresponding path program 1 times [2023-02-15 22:44:27,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:27,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734361950] [2023-02-15 22:44:27,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:27,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-15 22:44:27,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:27,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734361950] [2023-02-15 22:44:27,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734361950] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:44:27,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:44:27,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:44:27,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064808630] [2023-02-15 22:44:27,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:44:27,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:44:27,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:27,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:44:27,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:44:27,945 INFO L87 Difference]: Start difference. First operand 308 states and 384 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:28,267 INFO L93 Difference]: Finished difference Result 837 states and 1036 transitions. [2023-02-15 22:44:28,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:44:28,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2023-02-15 22:44:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:28,270 INFO L225 Difference]: With dead ends: 837 [2023-02-15 22:44:28,270 INFO L226 Difference]: Without dead ends: 693 [2023-02-15 22:44:28,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:44:28,270 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 455 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:28,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 959 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:44:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2023-02-15 22:44:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 304. [2023-02-15 22:44:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.2541254125412542) internal successors, (380), 303 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 380 transitions. [2023-02-15 22:44:28,281 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 380 transitions. Word has length 89 [2023-02-15 22:44:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:28,281 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 380 transitions. [2023-02-15 22:44:28,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 380 transitions. [2023-02-15 22:44:28,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-15 22:44:28,282 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:28,282 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:28,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 22:44:28,282 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:28,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:28,283 INFO L85 PathProgramCache]: Analyzing trace with hash 387927389, now seen corresponding path program 1 times [2023-02-15 22:44:28,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:28,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937339373] [2023-02-15 22:44:28,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:28,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 22:44:28,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:28,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937339373] [2023-02-15 22:44:28,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937339373] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:44:28,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043687226] [2023-02-15 22:44:28,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:28,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:44:28,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:44:28,416 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:44:28,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 22:44:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:28,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:44:28,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:44:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-15 22:44:28,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:44:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 22:44:28,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043687226] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:44:28,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:44:28,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 17 [2023-02-15 22:44:28,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590482922] [2023-02-15 22:44:28,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:44:28,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 22:44:28,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:28,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 22:44:28,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:44:28,826 INFO L87 Difference]: Start difference. First operand 304 states and 380 transitions. Second operand has 17 states, 17 states have (on average 9.176470588235293) internal successors, (156), 17 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:29,982 INFO L93 Difference]: Finished difference Result 1735 states and 2348 transitions. [2023-02-15 22:44:29,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 22:44:29,982 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.176470588235293) internal successors, (156), 17 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2023-02-15 22:44:29,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:29,986 INFO L225 Difference]: With dead ends: 1735 [2023-02-15 22:44:29,986 INFO L226 Difference]: Without dead ends: 1435 [2023-02-15 22:44:29,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 169 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=586, Invalid=1220, Unknown=0, NotChecked=0, Total=1806 [2023-02-15 22:44:29,987 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 1200 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:29,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 1249 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:44:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2023-02-15 22:44:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1235. [2023-02-15 22:44:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1234 states have (on average 1.372771474878444) internal successors, (1694), 1234 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1694 transitions. [2023-02-15 22:44:30,024 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1694 transitions. Word has length 90 [2023-02-15 22:44:30,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:30,025 INFO L495 AbstractCegarLoop]: Abstraction has 1235 states and 1694 transitions. [2023-02-15 22:44:30,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.176470588235293) internal successors, (156), 17 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:30,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1694 transitions. [2023-02-15 22:44:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-02-15 22:44:30,026 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:30,026 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:30,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 22:44:30,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:44:30,235 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:30,235 INFO L85 PathProgramCache]: Analyzing trace with hash -910381429, now seen corresponding path program 1 times [2023-02-15 22:44:30,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:30,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50320523] [2023-02-15 22:44:30,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:30,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 22:44:30,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:30,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50320523] [2023-02-15 22:44:30,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50320523] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:44:30,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437700518] [2023-02-15 22:44:30,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:30,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:44:30,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:44:30,433 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:44:30,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 22:44:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:30,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 22:44:30,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:44:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 22:44:30,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:44:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 22:44:31,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437700518] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:44:31,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:44:31,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 17 [2023-02-15 22:44:31,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620184599] [2023-02-15 22:44:31,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:44:31,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:44:31,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:31,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:44:31,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:44:31,125 INFO L87 Difference]: Start difference. First operand 1235 states and 1694 transitions. Second operand has 18 states, 17 states have (on average 11.647058823529411) internal successors, (198), 18 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:33,349 INFO L93 Difference]: Finished difference Result 9967 states and 12703 transitions. [2023-02-15 22:44:33,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 22:44:33,349 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 11.647058823529411) internal successors, (198), 18 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2023-02-15 22:44:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:33,370 INFO L225 Difference]: With dead ends: 9967 [2023-02-15 22:44:33,370 INFO L226 Difference]: Without dead ends: 8707 [2023-02-15 22:44:33,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2023-02-15 22:44:33,375 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 1161 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:33,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 1544 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:44:33,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8707 states. [2023-02-15 22:44:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8707 to 1996. [2023-02-15 22:44:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1996 states, 1995 states have (on average 1.3754385964912281) internal successors, (2744), 1995 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2744 transitions. [2023-02-15 22:44:33,501 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2744 transitions. Word has length 95 [2023-02-15 22:44:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:33,501 INFO L495 AbstractCegarLoop]: Abstraction has 1996 states and 2744 transitions. [2023-02-15 22:44:33,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 11.647058823529411) internal successors, (198), 18 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2744 transitions. [2023-02-15 22:44:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-15 22:44:33,504 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:33,504 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:33,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:44:33,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:44:33,711 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:33,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:33,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1586105425, now seen corresponding path program 1 times [2023-02-15 22:44:33,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:33,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777958052] [2023-02-15 22:44:33,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:33,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 22:44:33,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:44:33,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777958052] [2023-02-15 22:44:33,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777958052] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:44:33,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417880626] [2023-02-15 22:44:33,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:33,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:44:33,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:44:33,810 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:44:33,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 22:44:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:44:33,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:44:33,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:44:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 22:44:33,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:44:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 22:44:33,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417880626] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:44:33,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:44:33,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2023-02-15 22:44:33,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323225239] [2023-02-15 22:44:33,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:44:33,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:44:33,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:44:33,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:44:33,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:44:33,969 INFO L87 Difference]: Start difference. First operand 1996 states and 2744 transitions. Second operand has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:44:34,507 INFO L93 Difference]: Finished difference Result 5772 states and 7851 transitions. [2023-02-15 22:44:34,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 22:44:34,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2023-02-15 22:44:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:44:34,515 INFO L225 Difference]: With dead ends: 5772 [2023-02-15 22:44:34,515 INFO L226 Difference]: Without dead ends: 3433 [2023-02-15 22:44:34,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2023-02-15 22:44:34,517 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 512 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:44:34,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 454 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:44:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2023-02-15 22:44:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 2649. [2023-02-15 22:44:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 2648 states have (on average 1.297583081570997) internal successors, (3436), 2648 states have internal predecessors, (3436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 3436 transitions. [2023-02-15 22:44:34,628 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 3436 transitions. Word has length 101 [2023-02-15 22:44:34,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:44:34,628 INFO L495 AbstractCegarLoop]: Abstraction has 2649 states and 3436 transitions. [2023-02-15 22:44:34,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:44:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3436 transitions. [2023-02-15 22:44:34,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-02-15 22:44:34,630 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:44:34,630 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:34,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:44:34,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-15 22:44:34,835 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-15 22:44:34,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:44:34,836 INFO L85 PathProgramCache]: Analyzing trace with hash -702020810, now seen corresponding path program 1 times [2023-02-15 22:44:34,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:44:34,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189232306] [2023-02-15 22:44:34,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:44:34,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:44:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:44:34,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 22:44:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:44:34,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 22:44:34,920 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 22:44:34,921 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2023-02-15 22:44:34,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2023-02-15 22:44:34,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2023-02-15 22:44:34,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2023-02-15 22:44:34,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2023-02-15 22:44:34,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2023-02-15 22:44:34,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2023-02-15 22:44:34,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2023-02-15 22:44:34,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2023-02-15 22:44:34,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2023-02-15 22:44:34,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2023-02-15 22:44:34,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2023-02-15 22:44:34,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2023-02-15 22:44:34,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2023-02-15 22:44:34,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2023-02-15 22:44:34,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2023-02-15 22:44:34,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2023-02-15 22:44:34,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2023-02-15 22:44:34,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2023-02-15 22:44:34,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2023-02-15 22:44:34,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2023-02-15 22:44:34,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2023-02-15 22:44:34,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2023-02-15 22:44:34,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2023-02-15 22:44:34,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2023-02-15 22:44:34,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2023-02-15 22:44:34,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2023-02-15 22:44:34,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2023-02-15 22:44:34,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2023-02-15 22:44:34,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2023-02-15 22:44:34,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2023-02-15 22:44:34,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2023-02-15 22:44:34,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2023-02-15 22:44:34,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2023-02-15 22:44:34,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2023-02-15 22:44:34,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2023-02-15 22:44:34,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2023-02-15 22:44:34,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2023-02-15 22:44:34,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2023-02-15 22:44:34,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2023-02-15 22:44:34,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2023-02-15 22:44:34,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 22:44:34,931 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:44:34,935 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 22:44:35,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:44:35 BoogieIcfgContainer [2023-02-15 22:44:35,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 22:44:35,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 22:44:35,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 22:44:35,011 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 22:44:35,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:22" (3/4) ... [2023-02-15 22:44:35,014 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 22:44:35,095 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 22:44:35,095 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 22:44:35,095 INFO L158 Benchmark]: Toolchain (without parser) took 12989.11ms. Allocated memory was 119.5MB in the beginning and 249.6MB in the end (delta: 130.0MB). Free memory was 84.1MB in the beginning and 206.6MB in the end (delta: -122.5MB). Peak memory consumption was 146.6MB. Max. memory is 16.1GB. [2023-02-15 22:44:35,096 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 119.5MB. Free memory was 94.9MB in the beginning and 94.8MB in the end (delta: 132.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:44:35,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.49ms. Allocated memory is still 119.5MB. Free memory was 83.8MB in the beginning and 71.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 22:44:35,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.31ms. Allocated memory is still 119.5MB. Free memory was 71.5MB in the beginning and 68.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 22:44:35,097 INFO L158 Benchmark]: Boogie Preprocessor took 35.29ms. Allocated memory is still 119.5MB. Free memory was 68.4MB in the beginning and 66.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:44:35,097 INFO L158 Benchmark]: RCFGBuilder took 512.34ms. Allocated memory was 119.5MB in the beginning and 172.0MB in the end (delta: 52.4MB). Free memory was 66.3MB in the beginning and 138.0MB in the end (delta: -71.6MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2023-02-15 22:44:35,097 INFO L158 Benchmark]: TraceAbstraction took 12100.93ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 137.1MB in the beginning and 74.8MB in the end (delta: 62.2MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. [2023-02-15 22:44:35,098 INFO L158 Benchmark]: Witness Printer took 83.91ms. Allocated memory is still 249.6MB. Free memory was 74.8MB in the beginning and 206.6MB in the end (delta: -131.8MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2023-02-15 22:44:35,102 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 119.5MB. Free memory was 94.9MB in the beginning and 94.8MB in the end (delta: 132.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.49ms. Allocated memory is still 119.5MB. Free memory was 83.8MB in the beginning and 71.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.31ms. Allocated memory is still 119.5MB. Free memory was 71.5MB in the beginning and 68.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.29ms. Allocated memory is still 119.5MB. Free memory was 68.4MB in the beginning and 66.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 512.34ms. Allocated memory was 119.5MB in the beginning and 172.0MB in the end (delta: 52.4MB). Free memory was 66.3MB in the beginning and 138.0MB in the end (delta: -71.6MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12100.93ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 137.1MB in the beginning and 74.8MB in the end (delta: 62.2MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. * Witness Printer took 83.91ms. Allocated memory is still 249.6MB. Free memory was 74.8MB in the beginning and 206.6MB in the end (delta: -131.8MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=101, r0=101] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L116] r1 << 8U VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L116] r2 << 16U VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L116] r3 << 24U VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4592 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4592 mSDsluCounter, 7212 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5313 mSDsCounter, 371 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3929 IncrementalHoareTripleChecker+Invalid, 4300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 371 mSolverCounterUnsat, 1899 mSDtfsCounter, 3929 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1049 GetRequests, 867 SyntacticMatches, 15 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2649occurred in iteration=16, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 9152 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1614 NumberOfCodeBlocks, 1614 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 10425 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1270 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 27 InterpolantComputations, 13 PerfectInterpolantSequences, 1108/1375 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-15 22:44:35,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)