./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 07:41:07,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 07:41:07,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 07:41:07,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 07:41:07,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 07:41:07,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 07:41:07,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 07:41:07,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 07:41:07,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 07:41:07,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 07:41:07,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 07:41:07,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 07:41:07,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 07:41:07,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 07:41:07,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 07:41:07,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 07:41:07,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 07:41:07,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 07:41:07,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 07:41:07,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 07:41:07,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 07:41:07,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 07:41:07,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 07:41:07,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 07:41:07,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 07:41:07,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 07:41:07,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 07:41:07,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 07:41:07,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 07:41:07,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 07:41:07,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 07:41:07,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 07:41:07,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 07:41:07,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 07:41:07,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 07:41:07,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 07:41:07,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 07:41:07,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 07:41:07,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 07:41:07,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 07:41:07,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 07:41:07,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-18 07:41:07,704 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 07:41:07,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 07:41:07,705 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 07:41:07,705 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 07:41:07,706 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 07:41:07,706 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 07:41:07,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 07:41:07,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 07:41:07,707 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 07:41:07,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 07:41:07,708 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 07:41:07,708 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 07:41:07,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 07:41:07,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 07:41:07,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 07:41:07,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 07:41:07,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 07:41:07,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 07:41:07,709 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-18 07:41:07,709 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 07:41:07,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 07:41:07,710 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 07:41:07,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 07:41:07,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 07:41:07,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 07:41:07,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 07:41:07,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:41:07,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 07:41:07,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 07:41:07,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 07:41:07,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 07:41:07,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 07:41:07,712 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 07:41:07,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 07:41:07,712 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 07:41:07,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 07:41:07,712 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 07:41:07,713 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 [2023-02-18 07:41:07,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 07:41:07,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 07:41:07,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 07:41:07,980 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 07:41:07,981 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 07:41:07,982 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-1.i [2023-02-18 07:41:09,111 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 07:41:09,285 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 07:41:09,285 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i [2023-02-18 07:41:09,294 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70bc4d2af/f7a3a00162f844dc92c044392a48e201/FLAG7b108406b [2023-02-18 07:41:09,311 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70bc4d2af/f7a3a00162f844dc92c044392a48e201 [2023-02-18 07:41:09,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 07:41:09,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 07:41:09,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 07:41:09,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 07:41:09,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 07:41:09,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581c2439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09, skipping insertion in model container [2023-02-18 07:41:09,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 07:41:09,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 07:41:09,459 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i[1168,1181] [2023-02-18 07:41:09,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:41:09,517 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 07:41:09,526 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i[1168,1181] [2023-02-18 07:41:09,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:41:09,558 INFO L208 MainTranslator]: Completed translation [2023-02-18 07:41:09,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09 WrapperNode [2023-02-18 07:41:09,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 07:41:09,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 07:41:09,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 07:41:09,560 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 07:41:09,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,615 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 182 [2023-02-18 07:41:09,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 07:41:09,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 07:41:09,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 07:41:09,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 07:41:09,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,643 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 07:41:09,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 07:41:09,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 07:41:09,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 07:41:09,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:41:09,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:09,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 07:41:09,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 07:41:09,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 07:41:09,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 07:41:09,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 07:41:09,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 07:41:09,805 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 07:41:09,807 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 07:41:10,282 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 07:41:10,289 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 07:41:10,289 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 07:41:10,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:41:10 BoogieIcfgContainer [2023-02-18 07:41:10,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 07:41:10,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 07:41:10,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 07:41:10,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 07:41:10,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:41:09" (1/3) ... [2023-02-18 07:41:10,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b45bd61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:41:10, skipping insertion in model container [2023-02-18 07:41:10,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (2/3) ... [2023-02-18 07:41:10,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b45bd61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:41:10, skipping insertion in model container [2023-02-18 07:41:10,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:41:10" (3/3) ... [2023-02-18 07:41:10,333 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2023-02-18 07:41:10,357 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 07:41:10,357 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-02-18 07:41:10,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 07:41:10,406 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;@28e175fa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 07:41:10,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-02-18 07:41:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-18 07:41:10,417 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:10,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-18 07:41:10,418 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:10,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:10,423 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2023-02-18 07:41:10,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:10,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659485194] [2023-02-18 07:41:10,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:10,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:10,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:10,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659485194] [2023-02-18 07:41:10,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659485194] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:10,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:10,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-18 07:41:10,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510275639] [2023-02-18 07:41:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:10,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 07:41:10,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:10,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 07:41:10,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 07:41:10,608 INFO L87 Difference]: Start difference. First operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:10,635 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2023-02-18 07:41:10,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 07:41:10,637 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-18 07:41:10,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:10,643 INFO L225 Difference]: With dead ends: 153 [2023-02-18 07:41:10,643 INFO L226 Difference]: Without dead ends: 76 [2023-02-18 07:41:10,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 07:41:10,649 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:10,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:41:10,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-18 07:41:10,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-18 07:41:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2023-02-18 07:41:10,680 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 4 [2023-02-18 07:41:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:10,680 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2023-02-18 07:41:10,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2023-02-18 07:41:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 07:41:10,682 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:10,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:10,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 07:41:10,683 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:10,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:10,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1140047638, now seen corresponding path program 1 times [2023-02-18 07:41:10,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:10,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386510078] [2023-02-18 07:41:10,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:10,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:10,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:10,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386510078] [2023-02-18 07:41:10,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386510078] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:10,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:10,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:41:10,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926402329] [2023-02-18 07:41:10,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:10,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 07:41:10,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:10,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 07:41:10,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:41:10,836 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:10,966 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2023-02-18 07:41:10,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 07:41:10,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-18 07:41:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:10,967 INFO L225 Difference]: With dead ends: 162 [2023-02-18 07:41:10,968 INFO L226 Difference]: Without dead ends: 108 [2023-02-18 07:41:10,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:41:10,969 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 35 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:10,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 135 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:41:10,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-18 07:41:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-02-18 07:41:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2023-02-18 07:41:10,979 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 17 [2023-02-18 07:41:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:10,979 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2023-02-18 07:41:10,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2023-02-18 07:41:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 07:41:10,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:10,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:10,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 07:41:10,981 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:10,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:10,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1047629272, now seen corresponding path program 1 times [2023-02-18 07:41:10,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:10,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730346317] [2023-02-18 07:41:10,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:10,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:41:11,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:11,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730346317] [2023-02-18 07:41:11,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730346317] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:11,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:11,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:41:11,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54463406] [2023-02-18 07:41:11,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:11,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:41:11,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:11,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:41:11,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:41:11,155 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:11,337 INFO L93 Difference]: Finished difference Result 251 states and 338 transitions. [2023-02-18 07:41:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:41:11,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-18 07:41:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:11,344 INFO L225 Difference]: With dead ends: 251 [2023-02-18 07:41:11,344 INFO L226 Difference]: Without dead ends: 184 [2023-02-18 07:41:11,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:41:11,351 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 136 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:11,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 315 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:41:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-18 07:41:11,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 114. [2023-02-18 07:41:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.3185840707964602) internal successors, (149), 113 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 149 transitions. [2023-02-18 07:41:11,375 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 149 transitions. Word has length 24 [2023-02-18 07:41:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:11,375 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 149 transitions. [2023-02-18 07:41:11,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 149 transitions. [2023-02-18 07:41:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 07:41:11,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:11,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:11,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 07:41:11,378 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:11,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:11,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1448694967, now seen corresponding path program 1 times [2023-02-18 07:41:11,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:11,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153223967] [2023-02-18 07:41:11,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:11,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:41:11,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:11,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153223967] [2023-02-18 07:41:11,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153223967] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:11,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:11,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:41:11,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690998737] [2023-02-18 07:41:11,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:11,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 07:41:11,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:11,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 07:41:11,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:41:11,552 INFO L87 Difference]: Start difference. First operand 114 states and 149 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:11,561 INFO L93 Difference]: Finished difference Result 182 states and 242 transitions. [2023-02-18 07:41:11,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 07:41:11,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-18 07:41:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:11,563 INFO L225 Difference]: With dead ends: 182 [2023-02-18 07:41:11,564 INFO L226 Difference]: Without dead ends: 91 [2023-02-18 07:41:11,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:41:11,566 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 89 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:11,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 91 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:41:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-18 07:41:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-18 07:41:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2023-02-18 07:41:11,582 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 27 [2023-02-18 07:41:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:11,582 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2023-02-18 07:41:11,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2023-02-18 07:41:11,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 07:41:11,584 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:11,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:11,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 07:41:11,585 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:11,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1250590583, now seen corresponding path program 1 times [2023-02-18 07:41:11,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:11,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731376983] [2023-02-18 07:41:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:11,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:11,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:11,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731376983] [2023-02-18 07:41:11,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731376983] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:11,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:11,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:41:11,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534719444] [2023-02-18 07:41:11,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:11,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:41:11,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:11,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:41:11,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:41:11,713 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:11,871 INFO L93 Difference]: Finished difference Result 242 states and 322 transitions. [2023-02-18 07:41:11,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:41:11,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-18 07:41:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:11,873 INFO L225 Difference]: With dead ends: 242 [2023-02-18 07:41:11,874 INFO L226 Difference]: Without dead ends: 173 [2023-02-18 07:41:11,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:41:11,877 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 133 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:11,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 293 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:41:11,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-02-18 07:41:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 96. [2023-02-18 07:41:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.3157894736842106) internal successors, (125), 95 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2023-02-18 07:41:11,893 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 33 [2023-02-18 07:41:11,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:11,893 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2023-02-18 07:41:11,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2023-02-18 07:41:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 07:41:11,895 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:11,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:11,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 07:41:11,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:11,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:11,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1993043557, now seen corresponding path program 1 times [2023-02-18 07:41:11,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:11,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688825015] [2023-02-18 07:41:11,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:11,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:12,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:12,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688825015] [2023-02-18 07:41:12,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688825015] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:12,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208753571] [2023-02-18 07:41:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:12,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:12,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:12,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:12,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 07:41:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:12,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 07:41:12,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:12,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:41:12,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208753571] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:12,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:41:12,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-02-18 07:41:12,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658037742] [2023-02-18 07:41:12,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:12,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:41:12,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:12,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:41:12,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:41:12,178 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:12,350 INFO L93 Difference]: Finished difference Result 205 states and 297 transitions. [2023-02-18 07:41:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:41:12,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-18 07:41:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:12,352 INFO L225 Difference]: With dead ends: 205 [2023-02-18 07:41:12,352 INFO L226 Difference]: Without dead ends: 151 [2023-02-18 07:41:12,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:41:12,356 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 56 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:12,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 156 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:41:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-18 07:41:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2023-02-18 07:41:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 169 transitions. [2023-02-18 07:41:12,370 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 169 transitions. Word has length 36 [2023-02-18 07:41:12,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:12,370 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 169 transitions. [2023-02-18 07:41:12,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2023-02-18 07:41:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 07:41:12,375 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:12,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:12,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 07:41:12,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-18 07:41:12,582 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:12,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:12,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1280522041, now seen corresponding path program 1 times [2023-02-18 07:41:12,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:12,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487144231] [2023-02-18 07:41:12,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:12,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:12,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:12,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487144231] [2023-02-18 07:41:12,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487144231] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:12,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601340585] [2023-02-18 07:41:12,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:12,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:12,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:12,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:12,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 07:41:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:12,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 07:41:12,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:41:12,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:41:12,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601340585] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:12,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:41:12,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-02-18 07:41:12,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037176248] [2023-02-18 07:41:12,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:12,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:41:12,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:12,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:41:12,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:41:12,858 INFO L87 Difference]: Start difference. First operand 133 states and 169 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:12,948 INFO L93 Difference]: Finished difference Result 243 states and 321 transitions. [2023-02-18 07:41:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 07:41:12,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-18 07:41:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:12,950 INFO L225 Difference]: With dead ends: 243 [2023-02-18 07:41:12,950 INFO L226 Difference]: Without dead ends: 131 [2023-02-18 07:41:12,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-18 07:41:12,951 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 130 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:12,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 128 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:41:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-18 07:41:12,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2023-02-18 07:41:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.2857142857142858) internal successors, (153), 119 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 153 transitions. [2023-02-18 07:41:12,957 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 153 transitions. Word has length 43 [2023-02-18 07:41:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:12,957 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 153 transitions. [2023-02-18 07:41:12,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 153 transitions. [2023-02-18 07:41:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-18 07:41:12,958 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:12,958 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:12,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 07:41:13,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-02-18 07:41:13,164 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:13,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:13,165 INFO L85 PathProgramCache]: Analyzing trace with hash -493197952, now seen corresponding path program 1 times [2023-02-18 07:41:13,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:13,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76671232] [2023-02-18 07:41:13,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:13,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:13,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:13,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76671232] [2023-02-18 07:41:13,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76671232] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:13,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125340509] [2023-02-18 07:41:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:13,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:13,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:13,341 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:13,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 07:41:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:13,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 07:41:13,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 07:41:13,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:41:13,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125340509] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:13,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:41:13,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-02-18 07:41:13,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229533526] [2023-02-18 07:41:13,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:13,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:41:13,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:13,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:41:13,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:41:13,482 INFO L87 Difference]: Start difference. First operand 120 states and 153 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:13,601 INFO L93 Difference]: Finished difference Result 273 states and 368 transitions. [2023-02-18 07:41:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:41:13,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-02-18 07:41:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:13,603 INFO L225 Difference]: With dead ends: 273 [2023-02-18 07:41:13,603 INFO L226 Difference]: Without dead ends: 167 [2023-02-18 07:41:13,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:41:13,604 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 41 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:13,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 193 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:41:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-18 07:41:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 141. [2023-02-18 07:41:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.2642857142857142) internal successors, (177), 140 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 177 transitions. [2023-02-18 07:41:13,608 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 177 transitions. Word has length 52 [2023-02-18 07:41:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:13,610 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 177 transitions. [2023-02-18 07:41:13,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 177 transitions. [2023-02-18 07:41:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-18 07:41:13,611 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:13,611 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:13,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 07:41:13,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:13,812 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:13,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash -271705697, now seen corresponding path program 1 times [2023-02-18 07:41:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:13,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128173002] [2023-02-18 07:41:13,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:13,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:14,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:14,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128173002] [2023-02-18 07:41:14,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128173002] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:14,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16628481] [2023-02-18 07:41:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:14,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:14,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:14,022 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:14,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 07:41:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:14,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:41:14,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-18 07:41:14,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:41:14,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16628481] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:14,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:41:14,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-02-18 07:41:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859195853] [2023-02-18 07:41:14,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:14,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:41:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:14,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:41:14,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-18 07:41:14,138 INFO L87 Difference]: Start difference. First operand 141 states and 177 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:14,232 INFO L93 Difference]: Finished difference Result 315 states and 415 transitions. [2023-02-18 07:41:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:41:14,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-02-18 07:41:14,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:14,234 INFO L225 Difference]: With dead ends: 315 [2023-02-18 07:41:14,234 INFO L226 Difference]: Without dead ends: 187 [2023-02-18 07:41:14,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-18 07:41:14,235 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 41 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:14,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 194 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:41:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-18 07:41:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 162. [2023-02-18 07:41:14,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.2484472049689441) internal successors, (201), 161 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 201 transitions. [2023-02-18 07:41:14,240 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 201 transitions. Word has length 68 [2023-02-18 07:41:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:14,241 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 201 transitions. [2023-02-18 07:41:14,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 201 transitions. [2023-02-18 07:41:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-02-18 07:41:14,242 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:14,242 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:14,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-18 07:41:14,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:14,448 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:14,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1991578566, now seen corresponding path program 1 times [2023-02-18 07:41:14,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:14,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775933735] [2023-02-18 07:41:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:14,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-02-18 07:41:14,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:14,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775933735] [2023-02-18 07:41:14,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775933735] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:14,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:14,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 07:41:14,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849110011] [2023-02-18 07:41:14,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:14,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:41:14,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:14,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:41:14,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:41:14,617 INFO L87 Difference]: Start difference. First operand 162 states and 201 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:14,850 INFO L93 Difference]: Finished difference Result 633 states and 784 transitions. [2023-02-18 07:41:14,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:41:14,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2023-02-18 07:41:14,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:14,852 INFO L225 Difference]: With dead ends: 633 [2023-02-18 07:41:14,852 INFO L226 Difference]: Without dead ends: 493 [2023-02-18 07:41:14,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:41:14,853 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 245 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:14,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 490 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:41:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2023-02-18 07:41:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 162. [2023-02-18 07:41:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.2484472049689441) internal successors, (201), 161 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 201 transitions. [2023-02-18 07:41:14,860 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 201 transitions. Word has length 84 [2023-02-18 07:41:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:14,860 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 201 transitions. [2023-02-18 07:41:14,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:14,860 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 201 transitions. [2023-02-18 07:41:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-18 07:41:14,861 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:14,861 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:14,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 07:41:14,862 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:14,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:14,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1230056049, now seen corresponding path program 1 times [2023-02-18 07:41:14,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:14,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830386418] [2023-02-18 07:41:14,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:14,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:15,039 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-02-18 07:41:15,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:15,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830386418] [2023-02-18 07:41:15,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830386418] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:15,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:15,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 07:41:15,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104090184] [2023-02-18 07:41:15,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:15,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 07:41:15,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:15,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 07:41:15,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:41:15,042 INFO L87 Difference]: Start difference. First operand 162 states and 201 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:15,387 INFO L93 Difference]: Finished difference Result 801 states and 990 transitions. [2023-02-18 07:41:15,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 07:41:15,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2023-02-18 07:41:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:15,390 INFO L225 Difference]: With dead ends: 801 [2023-02-18 07:41:15,390 INFO L226 Difference]: Without dead ends: 661 [2023-02-18 07:41:15,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-18 07:41:15,391 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 368 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:15,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 640 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:41:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2023-02-18 07:41:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 162. [2023-02-18 07:41:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.2484472049689441) internal successors, (201), 161 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 201 transitions. [2023-02-18 07:41:15,398 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 201 transitions. Word has length 87 [2023-02-18 07:41:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:15,398 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 201 transitions. [2023-02-18 07:41:15,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 201 transitions. [2023-02-18 07:41:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-18 07:41:15,399 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:15,400 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:15,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-18 07:41:15,400 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:15,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1677424560, now seen corresponding path program 1 times [2023-02-18 07:41:15,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:15,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711691502] [2023-02-18 07:41:15,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:15,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-18 07:41:15,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:15,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711691502] [2023-02-18 07:41:15,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711691502] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:15,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702945279] [2023-02-18 07:41:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:15,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:15,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:15,537 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:15,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 07:41:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:15,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 07:41:15,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-18 07:41:15,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:41:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-02-18 07:41:15,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702945279] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:41:15,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:41:15,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 6] total 10 [2023-02-18 07:41:15,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093570666] [2023-02-18 07:41:15,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:41:15,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 07:41:15,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:15,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 07:41:15,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:41:15,691 INFO L87 Difference]: Start difference. First operand 162 states and 201 transitions. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:16,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:16,307 INFO L93 Difference]: Finished difference Result 835 states and 1127 transitions. [2023-02-18 07:41:16,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-18 07:41:16,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2023-02-18 07:41:16,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:16,310 INFO L225 Difference]: With dead ends: 835 [2023-02-18 07:41:16,310 INFO L226 Difference]: Without dead ends: 676 [2023-02-18 07:41:16,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2023-02-18 07:41:16,311 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 443 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:16,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 527 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 07:41:16,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2023-02-18 07:41:16,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 554. [2023-02-18 07:41:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 1.298372513562387) internal successors, (718), 553 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 718 transitions. [2023-02-18 07:41:16,329 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 718 transitions. Word has length 87 [2023-02-18 07:41:16,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:16,330 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 718 transitions. [2023-02-18 07:41:16,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:16,330 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 718 transitions. [2023-02-18 07:41:16,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-18 07:41:16,331 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:16,331 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:16,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 07:41:16,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-18 07:41:16,537 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1511267789, now seen corresponding path program 1 times [2023-02-18 07:41:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:16,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361443497] [2023-02-18 07:41:16,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:16,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-02-18 07:41:16,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:16,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361443497] [2023-02-18 07:41:16,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361443497] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:16,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:16,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 07:41:16,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727297861] [2023-02-18 07:41:16,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:16,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 07:41:16,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:16,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 07:41:16,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:41:16,734 INFO L87 Difference]: Start difference. First operand 554 states and 718 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:17,180 INFO L93 Difference]: Finished difference Result 1544 states and 2005 transitions. [2023-02-18 07:41:17,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 07:41:17,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2023-02-18 07:41:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:17,184 INFO L225 Difference]: With dead ends: 1544 [2023-02-18 07:41:17,184 INFO L226 Difference]: Without dead ends: 1193 [2023-02-18 07:41:17,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-18 07:41:17,186 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 489 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:17,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 957 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 07:41:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2023-02-18 07:41:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 549. [2023-02-18 07:41:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.2992700729927007) internal successors, (712), 548 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 712 transitions. [2023-02-18 07:41:17,206 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 712 transitions. Word has length 89 [2023-02-18 07:41:17,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:17,206 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 712 transitions. [2023-02-18 07:41:17,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:17,207 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 712 transitions. [2023-02-18 07:41:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-02-18 07:41:17,208 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:17,208 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:17,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-18 07:41:17,208 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:17,209 INFO L85 PathProgramCache]: Analyzing trace with hash -967413213, now seen corresponding path program 1 times [2023-02-18 07:41:17,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:17,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540167810] [2023-02-18 07:41:17,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:17,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-18 07:41:17,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:17,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540167810] [2023-02-18 07:41:17,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540167810] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:17,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634670040] [2023-02-18 07:41:17,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:17,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:17,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:17,386 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:17,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 07:41:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:17,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 07:41:17,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 47 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 07:41:17,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:41:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 07:41:17,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634670040] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:41:17,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:41:17,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-02-18 07:41:17,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265368039] [2023-02-18 07:41:17,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:41:17,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 07:41:17,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:17,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 07:41:17,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2023-02-18 07:41:17,744 INFO L87 Difference]: Start difference. First operand 549 states and 712 transitions. Second operand has 20 states, 20 states have (on average 12.05) internal successors, (241), 20 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:23,317 INFO L93 Difference]: Finished difference Result 7297 states and 9024 transitions. [2023-02-18 07:41:23,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2023-02-18 07:41:23,318 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 12.05) internal successors, (241), 20 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2023-02-18 07:41:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:23,340 INFO L225 Difference]: With dead ends: 7297 [2023-02-18 07:41:23,340 INFO L226 Difference]: Without dead ends: 6599 [2023-02-18 07:41:23,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 171 SyntacticMatches, 5 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8163 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2871, Invalid=19479, Unknown=0, NotChecked=0, Total=22350 [2023-02-18 07:41:23,349 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 1768 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 5389 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1768 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 5515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 5389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:23,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1768 Valid, 2413 Invalid, 5515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 5389 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-02-18 07:41:23,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6599 states. [2023-02-18 07:41:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6599 to 881. [2023-02-18 07:41:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.330681818181818) internal successors, (1171), 880 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1171 transitions. [2023-02-18 07:41:23,422 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1171 transitions. Word has length 93 [2023-02-18 07:41:23,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:23,422 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1171 transitions. [2023-02-18 07:41:23,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.05) internal successors, (241), 20 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1171 transitions. [2023-02-18 07:41:23,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-18 07:41:23,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:23,424 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:23,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 07:41:23,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:23,629 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:23,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:23,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1116141497, now seen corresponding path program 1 times [2023-02-18 07:41:23,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:23,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225764533] [2023-02-18 07:41:23,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:23,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-18 07:41:23,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:23,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225764533] [2023-02-18 07:41:23,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225764533] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:23,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831474045] [2023-02-18 07:41:23,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:23,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:23,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:23,817 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:23,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 07:41:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:23,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 07:41:23,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-18 07:41:23,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:41:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-18 07:41:23,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831474045] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:23,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:41:23,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2023-02-18 07:41:23,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648594634] [2023-02-18 07:41:23,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:24,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:41:24,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:24,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:41:24,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-18 07:41:24,001 INFO L87 Difference]: Start difference. First operand 881 states and 1171 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:24,186 INFO L93 Difference]: Finished difference Result 2424 states and 3282 transitions. [2023-02-18 07:41:24,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 07:41:24,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2023-02-18 07:41:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:24,192 INFO L225 Difference]: With dead ends: 2424 [2023-02-18 07:41:24,192 INFO L226 Difference]: Without dead ends: 1785 [2023-02-18 07:41:24,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 198 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-02-18 07:41:24,194 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 179 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:24,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 185 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:41:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2023-02-18 07:41:24,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1539. [2023-02-18 07:41:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1538 states have (on average 1.3530559167750325) internal successors, (2081), 1538 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2081 transitions. [2023-02-18 07:41:24,260 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2081 transitions. Word has length 101 [2023-02-18 07:41:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:24,261 INFO L495 AbstractCegarLoop]: Abstraction has 1539 states and 2081 transitions. [2023-02-18 07:41:24,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2081 transitions. [2023-02-18 07:41:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-02-18 07:41:24,265 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:24,266 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:24,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 07:41:24,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:24,472 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:24,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:24,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1501915936, now seen corresponding path program 1 times [2023-02-18 07:41:24,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:24,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588334502] [2023-02-18 07:41:24,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:24,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-18 07:41:24,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:24,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588334502] [2023-02-18 07:41:24,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588334502] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:24,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:24,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 07:41:24,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615709088] [2023-02-18 07:41:24,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:24,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 07:41:24,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:24,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 07:41:24,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:41:24,632 INFO L87 Difference]: Start difference. First operand 1539 states and 2081 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:24,938 INFO L93 Difference]: Finished difference Result 3218 states and 4325 transitions. [2023-02-18 07:41:24,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 07:41:24,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-02-18 07:41:24,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:24,944 INFO L225 Difference]: With dead ends: 3218 [2023-02-18 07:41:24,944 INFO L226 Difference]: Without dead ends: 1907 [2023-02-18 07:41:24,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-02-18 07:41:24,947 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 286 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:24,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 266 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:41:24,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2023-02-18 07:41:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1485. [2023-02-18 07:41:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1484 states have (on average 1.3268194070080863) internal successors, (1969), 1484 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 1969 transitions. [2023-02-18 07:41:25,024 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 1969 transitions. Word has length 102 [2023-02-18 07:41:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:25,025 INFO L495 AbstractCegarLoop]: Abstraction has 1485 states and 1969 transitions. [2023-02-18 07:41:25,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1969 transitions. [2023-02-18 07:41:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-02-18 07:41:25,028 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:25,028 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:25,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-18 07:41:25,029 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash -702020810, now seen corresponding path program 1 times [2023-02-18 07:41:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:25,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993788829] [2023-02-18 07:41:25,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:25,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 07:41:25,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 07:41:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 07:41:25,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 07:41:25,150 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 07:41:25,151 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2023-02-18 07:41:25,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2023-02-18 07:41:25,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2023-02-18 07:41:25,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2023-02-18 07:41:25,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2023-02-18 07:41:25,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2023-02-18 07:41:25,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2023-02-18 07:41:25,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2023-02-18 07:41:25,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2023-02-18 07:41:25,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2023-02-18 07:41:25,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2023-02-18 07:41:25,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2023-02-18 07:41:25,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2023-02-18 07:41:25,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2023-02-18 07:41:25,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2023-02-18 07:41:25,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2023-02-18 07:41:25,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2023-02-18 07:41:25,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2023-02-18 07:41:25,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2023-02-18 07:41:25,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2023-02-18 07:41:25,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2023-02-18 07:41:25,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2023-02-18 07:41:25,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2023-02-18 07:41:25,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2023-02-18 07:41:25,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2023-02-18 07:41:25,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2023-02-18 07:41:25,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2023-02-18 07:41:25,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2023-02-18 07:41:25,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2023-02-18 07:41:25,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2023-02-18 07:41:25,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2023-02-18 07:41:25,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2023-02-18 07:41:25,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2023-02-18 07:41:25,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2023-02-18 07:41:25,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2023-02-18 07:41:25,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2023-02-18 07:41:25,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2023-02-18 07:41:25,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2023-02-18 07:41:25,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2023-02-18 07:41:25,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2023-02-18 07:41:25,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2023-02-18 07:41:25,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-18 07:41:25,165 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:25,170 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 07:41:25,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 07:41:25 BoogieIcfgContainer [2023-02-18 07:41:25,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 07:41:25,275 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 07:41:25,275 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 07:41:25,275 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 07:41:25,276 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:41:10" (3/4) ... [2023-02-18 07:41:25,277 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-18 07:41:25,361 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 07:41:25,362 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 07:41:25,362 INFO L158 Benchmark]: Toolchain (without parser) took 16047.09ms. Allocated memory was 148.9MB in the beginning and 262.1MB in the end (delta: 113.2MB). Free memory was 99.5MB in the beginning and 171.7MB in the end (delta: -72.2MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2023-02-18 07:41:25,363 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 07:41:25,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.29ms. Allocated memory is still 148.9MB. Free memory was 99.1MB in the beginning and 87.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 07:41:25,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.73ms. Allocated memory is still 148.9MB. Free memory was 87.0MB in the beginning and 83.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 07:41:25,364 INFO L158 Benchmark]: Boogie Preprocessor took 29.84ms. Allocated memory is still 148.9MB. Free memory was 83.6MB in the beginning and 81.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 07:41:25,365 INFO L158 Benchmark]: RCFGBuilder took 642.37ms. Allocated memory is still 148.9MB. Free memory was 81.5MB in the beginning and 58.9MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-18 07:41:25,365 INFO L158 Benchmark]: TraceAbstraction took 14951.45ms. Allocated memory was 148.9MB in the beginning and 262.1MB in the end (delta: 113.2MB). Free memory was 117.0MB in the beginning and 180.1MB in the end (delta: -63.1MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2023-02-18 07:41:25,365 INFO L158 Benchmark]: Witness Printer took 86.84ms. Allocated memory is still 262.1MB. Free memory was 180.1MB in the beginning and 171.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 07:41:25,368 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.17ms. Allocated memory is still 148.9MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.29ms. Allocated memory is still 148.9MB. Free memory was 99.1MB in the beginning and 87.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.73ms. Allocated memory is still 148.9MB. Free memory was 87.0MB in the beginning and 83.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.84ms. Allocated memory is still 148.9MB. Free memory was 83.6MB in the beginning and 81.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 642.37ms. Allocated memory is still 148.9MB. Free memory was 81.5MB in the beginning and 58.9MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14951.45ms. Allocated memory was 148.9MB in the beginning and 262.1MB in the end (delta: 113.2MB). Free memory was 117.0MB in the beginning and 180.1MB in the end (delta: -63.1MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * Witness Printer took 86.84ms. Allocated memory is still 262.1MB. Free memory was 180.1MB in the beginning and 171.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L89] COND TRUE i < nb VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=101, r0=101] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L83] COND TRUE i < na VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L89] COND TRUE i < nb VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L83] COND TRUE i < na VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L89] COND TRUE i < nb VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L83] COND TRUE i < na VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=101, r1=81, r2=254] [L89] COND TRUE i < nb VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=101, r1=81, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=101, r1=81, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=101, r1=81, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=101, r1=81, r2=254] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=101, r1=81, r2=254] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254, r3=255] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254, r3=255] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254, r3=255] [L116] r1 << 8U VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254, r3=255] [L116] r2 << 16U VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254, r3=255] [L116] r3 << 24U VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254, r3=255] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - 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: 14.8s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4439 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4439 mSDsluCounter, 7099 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5167 mSDsCounter, 387 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8335 IncrementalHoareTripleChecker+Invalid, 8722 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 387 mSolverCounterUnsat, 1932 mSDtfsCounter, 8335 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1037 GetRequests, 748 SyntacticMatches, 42 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8357 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1539occurred in iteration=15, InterpolantAutomatonStates: 233, 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, 8213 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1532 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1682 ConstructedInterpolants, 0 QuantifiedInterpolants, 10173 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1130 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 26 InterpolantComputations, 14 PerfectInterpolantSequences, 1090/1299 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-18 07:41:25,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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)