./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/MultCommutative-1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/termination-numeric/MultCommutative-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 2f58e1f128e4dbefcdb138e1f7ef5e4260326da20e0bd376d80fe12a55b55920 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:06:19,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:06:19,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:06:19,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:06:19,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:06:19,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:06:19,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:06:19,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:06:19,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:06:19,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:06:19,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:06:19,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:06:19,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:06:19,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:06:19,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:06:19,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:06:19,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:06:19,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:06:19,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:06:19,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:06:19,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:06:19,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:06:19,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:06:19,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:06:19,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:06:19,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:06:19,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:06:19,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:06:19,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:06:19,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:06:19,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:06:19,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:06:19,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:06:19,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:06:19,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:06:19,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:06:19,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:06:19,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:06:19,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:06:19,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:06:19,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:06:19,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:06:19,396 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:06:19,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:06:19,397 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:06:19,398 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:06:19,399 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:06:19,399 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:06:19,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:06:19,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:06:19,400 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:06:19,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:06:19,401 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:06:19,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:06:19,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:06:19,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:06:19,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:06:19,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:06:19,403 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:06:19,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:06:19,403 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:06:19,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:06:19,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:06:19,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:06:19,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:06:19,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:06:19,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:06:19,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:06:19,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:06:19,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:06:19,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:06:19,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:06:19,406 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f58e1f128e4dbefcdb138e1f7ef5e4260326da20e0bd376d80fe12a55b55920 [2022-02-21 03:06:19,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:06:19,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:06:19,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:06:19,661 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:06:19,661 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:06:19,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/MultCommutative-1.c [2022-02-21 03:06:19,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33f10f10/73840f43220b4cafa2284632ef9e652f/FLAGbd5cb8f71 [2022-02-21 03:06:20,097 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:06:20,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/MultCommutative-1.c [2022-02-21 03:06:20,106 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33f10f10/73840f43220b4cafa2284632ef9e652f/FLAGbd5cb8f71 [2022-02-21 03:06:20,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33f10f10/73840f43220b4cafa2284632ef9e652f [2022-02-21 03:06:20,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:06:20,126 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:06:20,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:06:20,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:06:20,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:06:20,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:06:20" (1/1) ... [2022-02-21 03:06:20,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44487274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:20, skipping insertion in model container [2022-02-21 03:06:20,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:06:20" (1/1) ... [2022-02-21 03:06:20,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:06:20,152 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:06:20,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/MultCommutative-1.c[1008,1021] [2022-02-21 03:06:20,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:06:20,355 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:06:20,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/MultCommutative-1.c[1008,1021] [2022-02-21 03:06:20,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:06:20,398 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:06:20,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:20 WrapperNode [2022-02-21 03:06:20,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:06:20,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:06:20,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:06:20,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:06:20,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:20" (1/1) ... [2022-02-21 03:06:20,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:20" (1/1) ... [2022-02-21 03:06:20,435 INFO L137 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2022-02-21 03:06:20,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:06:20,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:06:20,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:06:20,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:06:20,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:20" (1/1) ... [2022-02-21 03:06:20,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:20" (1/1) ... [2022-02-21 03:06:20,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:20" (1/1) ... [2022-02-21 03:06:20,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:20" (1/1) ... [2022-02-21 03:06:20,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:20" (1/1) ... [2022-02-21 03:06:20,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:20" (1/1) ... [2022-02-21 03:06:20,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:20" (1/1) ... [2022-02-21 03:06:20,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:06:20,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:06:20,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:06:20,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:06:20,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:20" (1/1) ... [2022-02-21 03:06:20,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:06:20,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:20,498 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) [2022-02-21 03:06:20,527 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 [2022-02-21 03:06:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:06:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2022-02-21 03:06:20,544 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2022-02-21 03:06:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:06:20,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:06:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:06:20,591 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:06:20,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:06:20,781 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:06:20,800 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:06:20,802 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:06:20,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:06:20 BoogieIcfgContainer [2022-02-21 03:06:20,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:06:20,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:06:20,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:06:20,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:06:20,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:06:20" (1/3) ... [2022-02-21 03:06:20,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7635917d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:06:20, skipping insertion in model container [2022-02-21 03:06:20,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:20" (2/3) ... [2022-02-21 03:06:20,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7635917d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:06:20, skipping insertion in model container [2022-02-21 03:06:20,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:06:20" (3/3) ... [2022-02-21 03:06:20,822 INFO L111 eAbstractionObserver]: Analyzing ICFG MultCommutative-1.c [2022-02-21 03:06:20,825 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:06:20,826 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-21 03:06:20,854 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:06:20,859 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:06:20,859 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-21 03:06:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:06:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:06:20,876 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:20,876 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:20,876 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:20,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:20,880 INFO L85 PathProgramCache]: Analyzing trace with hash 617794544, now seen corresponding path program 1 times [2022-02-21 03:06:20,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:20,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205506620] [2022-02-21 03:06:20,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:20,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:21,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-02-21 03:06:21,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {37#true} is VALID [2022-02-21 03:06:21,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {37#true} is VALID [2022-02-21 03:06:21,065 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#true} assume !(main_~n~0#1 < 0); {39#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 03:06:21,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#(<= 0 |ULTIMATE.start_main_~n~0#1|)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {40#(<= 0 |mult_#in~m|)} is VALID [2022-02-21 03:06:21,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#(<= 0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {41#(<= 0 mult_~m)} is VALID [2022-02-21 03:06:21,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {41#(<= 0 mult_~m)} assume ~m < 0; {41#(<= 0 mult_~m)} is VALID [2022-02-21 03:06:21,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#(<= 0 mult_~m)} assume !(-~m <= 2147483647); {38#false} is VALID [2022-02-21 03:06:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:21,070 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:21,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205506620] [2022-02-21 03:06:21,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205506620] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:06:21,071 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:06:21,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:06:21,072 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675860765] [2022-02-21 03:06:21,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:06:21,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:06:21,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:21,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:21,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:21,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:06:21,091 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:21,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:06:21,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:06:21,112 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:21,361 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2022-02-21 03:06:21,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:06:21,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:06:21,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-02-21 03:06:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-02-21 03:06:21,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 99 transitions. [2022-02-21 03:06:21,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:21,464 INFO L225 Difference]: With dead ends: 81 [2022-02-21 03:06:21,464 INFO L226 Difference]: Without dead ends: 43 [2022-02-21 03:06:21,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:06:21,469 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 42 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:21,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 101 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:06:21,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-21 03:06:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2022-02-21 03:06:21,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:21,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 38 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 31 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:06:21,501 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 38 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 31 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:06:21,502 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 38 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 31 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:06:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:21,506 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-02-21 03:06:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-02-21 03:06:21,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:21,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:21,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 31 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-02-21 03:06:21,508 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 31 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-02-21 03:06:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:21,511 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-02-21 03:06:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-02-21 03:06:21,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:21,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:21,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:21,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 31 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:06:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-02-21 03:06:21,516 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 8 [2022-02-21 03:06:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:21,517 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-02-21 03:06:21,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-02-21 03:06:21,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:06:21,518 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:21,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:21,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:06:21,518 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:21,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1971768732, now seen corresponding path program 1 times [2022-02-21 03:06:21,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:21,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852252828] [2022-02-21 03:06:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:21,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {272#true} is VALID [2022-02-21 03:06:21,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {272#true} is VALID [2022-02-21 03:06:21,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {272#true} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {274#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:06:21,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {274#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~n~0#1 < 0); {274#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:06:21,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {274#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {275#(<= |mult_#in~m| 2147483647)} is VALID [2022-02-21 03:06:21,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {275#(<= |mult_#in~m| 2147483647)} ~n := #in~n;~m := #in~m; {276#(<= mult_~m 2147483647)} is VALID [2022-02-21 03:06:21,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(<= mult_~m 2147483647)} assume !(~m < 0); {276#(<= mult_~m 2147483647)} is VALID [2022-02-21 03:06:21,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(<= mult_~m 2147483647)} assume !(0 == ~m); {276#(<= mult_~m 2147483647)} is VALID [2022-02-21 03:06:21,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#(<= mult_~m 2147483647)} assume !(~m - 1 <= 2147483647); {273#false} is VALID [2022-02-21 03:06:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:21,563 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:21,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852252828] [2022-02-21 03:06:21,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852252828] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:06:21,564 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:06:21,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:06:21,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645002524] [2022-02-21 03:06:21,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:06:21,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:06:21,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:21,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:21,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:21,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:06:21,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:21,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:06:21,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:06:21,574 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:21,774 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-02-21 03:06:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:06:21,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:06:21,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-02-21 03:06:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:21,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-02-21 03:06:21,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-02-21 03:06:21,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:21,845 INFO L225 Difference]: With dead ends: 59 [2022-02-21 03:06:21,845 INFO L226 Difference]: Without dead ends: 57 [2022-02-21 03:06:21,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:06:21,846 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:21,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:06:21,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-21 03:06:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-02-21 03:06:21,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:21,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 52 states, 38 states have (on average 1.368421052631579) internal successors, (52), 42 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:06:21,869 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 52 states, 38 states have (on average 1.368421052631579) internal successors, (52), 42 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:06:21,869 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 52 states, 38 states have (on average 1.368421052631579) internal successors, (52), 42 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:06:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:21,872 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-02-21 03:06:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-02-21 03:06:21,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:21,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:21,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 38 states have (on average 1.368421052631579) internal successors, (52), 42 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-02-21 03:06:21,874 INFO L87 Difference]: Start difference. First operand has 52 states, 38 states have (on average 1.368421052631579) internal successors, (52), 42 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-02-21 03:06:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:21,877 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-02-21 03:06:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-02-21 03:06:21,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:21,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:21,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:21,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.368421052631579) internal successors, (52), 42 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:06:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2022-02-21 03:06:21,881 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 9 [2022-02-21 03:06:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:21,882 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2022-02-21 03:06:21,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-02-21 03:06:21,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:06:21,882 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:21,883 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:21,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:06:21,883 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash -323955617, now seen corresponding path program 1 times [2022-02-21 03:06:21,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:21,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298820327] [2022-02-21 03:06:21,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:21,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:21,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {526#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {526#true} is VALID [2022-02-21 03:06:21,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {526#true} is VALID [2022-02-21 03:06:21,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {526#true} is VALID [2022-02-21 03:06:21,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {526#true} assume !(main_~n~0#1 < 0); {526#true} is VALID [2022-02-21 03:06:21,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {526#true} is VALID [2022-02-21 03:06:21,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} ~n := #in~n;~m := #in~m; {526#true} is VALID [2022-02-21 03:06:21,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {526#true} assume !(~m < 0); {528#(<= 0 mult_~m)} is VALID [2022-02-21 03:06:21,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {528#(<= 0 mult_~m)} assume !(0 == ~m); {528#(<= 0 mult_~m)} is VALID [2022-02-21 03:06:21,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {528#(<= 0 mult_~m)} assume ~m - 1 <= 2147483647; {528#(<= 0 mult_~m)} is VALID [2022-02-21 03:06:21,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {528#(<= 0 mult_~m)} assume ~m - 1 >= -2147483648; {528#(<= 0 mult_~m)} is VALID [2022-02-21 03:06:21,954 INFO L272 TraceCheckUtils]: 10: Hoare triple {528#(<= 0 mult_~m)} call #t~ret5 := mult(~n, ~m - 1); {529#(<= 0 (+ |mult_#in~m| 1))} is VALID [2022-02-21 03:06:21,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {529#(<= 0 (+ |mult_#in~m| 1))} ~n := #in~n;~m := #in~m; {530#(<= 0 (+ mult_~m 1))} is VALID [2022-02-21 03:06:21,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {530#(<= 0 (+ mult_~m 1))} assume ~m < 0; {530#(<= 0 (+ mult_~m 1))} is VALID [2022-02-21 03:06:21,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {530#(<= 0 (+ mult_~m 1))} assume !(-~m <= 2147483647); {527#false} is VALID [2022-02-21 03:06:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:21,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:21,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298820327] [2022-02-21 03:06:21,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298820327] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:06:21,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:06:21,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:06:21,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320772483] [2022-02-21 03:06:21,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:06:21,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-21 03:06:21,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:21,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:21,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:21,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:06:21,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:21,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:06:21,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:06:21,970 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:22,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:22,144 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-02-21 03:06:22,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:06:22,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-21 03:06:22,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-02-21 03:06:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-02-21 03:06:22,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-02-21 03:06:22,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:22,200 INFO L225 Difference]: With dead ends: 77 [2022-02-21 03:06:22,200 INFO L226 Difference]: Without dead ends: 76 [2022-02-21 03:06:22,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:06:22,201 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:22,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 72 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:06:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-21 03:06:22,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2022-02-21 03:06:22,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:22,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 54 states have internal predecessors, (68), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:06:22,259 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 54 states have internal predecessors, (68), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:06:22,259 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 54 states have internal predecessors, (68), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:06:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:22,263 INFO L93 Difference]: Finished difference Result 76 states and 95 transitions. [2022-02-21 03:06:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2022-02-21 03:06:22,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:22,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:22,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 54 states have internal predecessors, (68), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-02-21 03:06:22,265 INFO L87 Difference]: Start difference. First operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 54 states have internal predecessors, (68), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-02-21 03:06:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:22,269 INFO L93 Difference]: Finished difference Result 76 states and 95 transitions. [2022-02-21 03:06:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2022-02-21 03:06:22,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:22,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:22,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:22,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 54 states have internal predecessors, (68), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:06:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-02-21 03:06:22,273 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 14 [2022-02-21 03:06:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:22,273 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-02-21 03:06:22,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-02-21 03:06:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:06:22,274 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:22,274 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:22,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:06:22,274 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:22,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1630133947, now seen corresponding path program 1 times [2022-02-21 03:06:22,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:22,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672184967] [2022-02-21 03:06:22,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:22,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:06:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:22,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {860#true} ~n := #in~n;~m := #in~m; {860#true} is VALID [2022-02-21 03:06:22,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {860#true} assume !(~m < 0); {860#true} is VALID [2022-02-21 03:06:22,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {860#true} assume 0 == ~m;#res := 0; {860#true} is VALID [2022-02-21 03:06:22,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {860#true} assume true; {860#true} is VALID [2022-02-21 03:06:22,327 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {860#true} {862#(<= 0 |ULTIMATE.start_main_~m~0#1|)} #58#return; {862#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:06:22,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {860#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {860#true} is VALID [2022-02-21 03:06:22,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {860#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {860#true} is VALID [2022-02-21 03:06:22,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {860#true} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {862#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:06:22,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {862#(<= 0 |ULTIMATE.start_main_~m~0#1|)} assume !(main_~n~0#1 < 0); {862#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:06:22,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {862#(<= 0 |ULTIMATE.start_main_~m~0#1|)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {860#true} is VALID [2022-02-21 03:06:22,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {860#true} ~n := #in~n;~m := #in~m; {860#true} is VALID [2022-02-21 03:06:22,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {860#true} assume !(~m < 0); {860#true} is VALID [2022-02-21 03:06:22,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {860#true} assume 0 == ~m;#res := 0; {860#true} is VALID [2022-02-21 03:06:22,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#true} assume true; {860#true} is VALID [2022-02-21 03:06:22,330 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {860#true} {862#(<= 0 |ULTIMATE.start_main_~m~0#1|)} #58#return; {862#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:06:22,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {862#(<= 0 |ULTIMATE.start_main_~m~0#1|)} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~res1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {862#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:06:22,331 INFO L272 TraceCheckUtils]: 11: Hoare triple {862#(<= 0 |ULTIMATE.start_main_~m~0#1|)} call main_#t~ret9#1 := mult(main_~n~0#1, main_~m~0#1); {868#(<= 0 |mult_#in~m|)} is VALID [2022-02-21 03:06:22,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {868#(<= 0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {869#(<= 0 mult_~m)} is VALID [2022-02-21 03:06:22,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {869#(<= 0 mult_~m)} assume ~m < 0; {869#(<= 0 mult_~m)} is VALID [2022-02-21 03:06:22,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {869#(<= 0 mult_~m)} assume !(-~m <= 2147483647); {861#false} is VALID [2022-02-21 03:06:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:22,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:22,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672184967] [2022-02-21 03:06:22,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672184967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:06:22,333 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:06:22,333 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:06:22,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586939017] [2022-02-21 03:06:22,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:06:22,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-21 03:06:22,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:22,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:06:22,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:22,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:06:22,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:22,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:06:22,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:06:22,346 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:06:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:22,512 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2022-02-21 03:06:22,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:06:22,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-21 03:06:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:06:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-02-21 03:06:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:06:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-02-21 03:06:22,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-02-21 03:06:22,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:22,579 INFO L225 Difference]: With dead ends: 121 [2022-02-21 03:06:22,585 INFO L226 Difference]: Without dead ends: 85 [2022-02-21 03:06:22,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:06:22,600 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 25 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:22,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 93 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:06:22,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-21 03:06:22,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2022-02-21 03:06:22,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:22,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 76 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 61 states have internal predecessors, (78), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-21 03:06:22,640 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 76 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 61 states have internal predecessors, (78), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-21 03:06:22,640 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 76 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 61 states have internal predecessors, (78), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-21 03:06:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:22,645 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2022-02-21 03:06:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2022-02-21 03:06:22,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:22,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:22,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 61 states have internal predecessors, (78), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 85 states. [2022-02-21 03:06:22,646 INFO L87 Difference]: Start difference. First operand has 76 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 61 states have internal predecessors, (78), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 85 states. [2022-02-21 03:06:22,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:22,651 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2022-02-21 03:06:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2022-02-21 03:06:22,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:22,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:22,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:22,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 61 states have internal predecessors, (78), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-21 03:06:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-02-21 03:06:22,656 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 15 [2022-02-21 03:06:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:22,656 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-02-21 03:06:22,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:06:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-02-21 03:06:22,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 03:06:22,657 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:22,657 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:22,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:06:22,658 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:22,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:22,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1005448143, now seen corresponding path program 1 times [2022-02-21 03:06:22,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:22,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312390752] [2022-02-21 03:06:22,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:22,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:22,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:06:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:22,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#true} ~n := #in~n;~m := #in~m; {1278#true} is VALID [2022-02-21 03:06:22,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#true} assume !(~m < 0); {1278#true} is VALID [2022-02-21 03:06:22,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {1278#true} assume 0 == ~m;#res := 0; {1278#true} is VALID [2022-02-21 03:06:22,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {1278#true} assume true; {1278#true} is VALID [2022-02-21 03:06:22,738 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1278#true} {1280#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} #58#return; {1280#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:22,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {1278#true} is VALID [2022-02-21 03:06:22,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1280#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:22,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {1280#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1280#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:22,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {1280#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~n~0#1 < 0); {1280#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:22,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {1280#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {1278#true} is VALID [2022-02-21 03:06:22,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {1278#true} ~n := #in~n;~m := #in~m; {1278#true} is VALID [2022-02-21 03:06:22,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {1278#true} assume !(~m < 0); {1278#true} is VALID [2022-02-21 03:06:22,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {1278#true} assume 0 == ~m;#res := 0; {1278#true} is VALID [2022-02-21 03:06:22,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {1278#true} assume true; {1278#true} is VALID [2022-02-21 03:06:22,744 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1278#true} {1280#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} #58#return; {1280#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:22,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {1280#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~res1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1280#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:22,745 INFO L272 TraceCheckUtils]: 11: Hoare triple {1280#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} call main_#t~ret9#1 := mult(main_~n~0#1, main_~m~0#1); {1286#(<= |mult_#in~m| 2147483647)} is VALID [2022-02-21 03:06:22,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {1286#(<= |mult_#in~m| 2147483647)} ~n := #in~n;~m := #in~m; {1287#(<= mult_~m 2147483647)} is VALID [2022-02-21 03:06:22,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {1287#(<= mult_~m 2147483647)} assume !(~m < 0); {1287#(<= mult_~m 2147483647)} is VALID [2022-02-21 03:06:22,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {1287#(<= mult_~m 2147483647)} assume !(0 == ~m); {1287#(<= mult_~m 2147483647)} is VALID [2022-02-21 03:06:22,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {1287#(<= mult_~m 2147483647)} assume !(~m - 1 <= 2147483647); {1279#false} is VALID [2022-02-21 03:06:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:22,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:22,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312390752] [2022-02-21 03:06:22,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312390752] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:06:22,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:06:22,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:06:22,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868846635] [2022-02-21 03:06:22,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:06:22,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-21 03:06:22,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:22,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:06:22,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:22,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:06:22,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:22,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:06:22,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:06:22,759 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:06:22,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:22,939 INFO L93 Difference]: Finished difference Result 102 states and 131 transitions. [2022-02-21 03:06:22,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:06:22,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-21 03:06:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:22,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:06:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-21 03:06:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:06:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-21 03:06:22,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-02-21 03:06:22,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:22,985 INFO L225 Difference]: With dead ends: 102 [2022-02-21 03:06:22,985 INFO L226 Difference]: Without dead ends: 101 [2022-02-21 03:06:22,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:06:22,986 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:22,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 103 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:06:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-21 03:06:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2022-02-21 03:06:23,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:23,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 91 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 73 states have internal predecessors, (93), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:06:23,018 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 91 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 73 states have internal predecessors, (93), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:06:23,019 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 91 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 73 states have internal predecessors, (93), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:06:23,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:23,022 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2022-02-21 03:06:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2022-02-21 03:06:23,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:23,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:23,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 73 states have internal predecessors, (93), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 101 states. [2022-02-21 03:06:23,024 INFO L87 Difference]: Start difference. First operand has 91 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 73 states have internal predecessors, (93), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 101 states. [2022-02-21 03:06:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:23,028 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2022-02-21 03:06:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2022-02-21 03:06:23,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:23,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:23,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:23,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:23,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 73 states have internal predecessors, (93), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:06:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2022-02-21 03:06:23,039 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 16 [2022-02-21 03:06:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:23,039 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2022-02-21 03:06:23,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:06:23,040 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2022-02-21 03:06:23,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:06:23,040 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:23,040 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:23,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:06:23,041 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:23,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:23,041 INFO L85 PathProgramCache]: Analyzing trace with hash -385899469, now seen corresponding path program 1 times [2022-02-21 03:06:23,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:23,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991049365] [2022-02-21 03:06:23,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:23,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:23,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {1724#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {1724#true} is VALID [2022-02-21 03:06:23,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {1724#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1724#true} is VALID [2022-02-21 03:06:23,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {1724#true} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1724#true} is VALID [2022-02-21 03:06:23,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {1724#true} assume !(main_~n~0#1 < 0); {1724#true} is VALID [2022-02-21 03:06:23,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {1724#true} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {1724#true} is VALID [2022-02-21 03:06:23,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {1724#true} ~n := #in~n;~m := #in~m; {1724#true} is VALID [2022-02-21 03:06:23,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {1724#true} assume !(~m < 0); {1726#(< 0 (+ mult_~m 1))} is VALID [2022-02-21 03:06:23,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {1726#(< 0 (+ mult_~m 1))} assume !(0 == ~m); {1727#(not (<= mult_~m 0))} is VALID [2022-02-21 03:06:23,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {1727#(not (<= mult_~m 0))} assume ~m - 1 <= 2147483647; {1727#(not (<= mult_~m 0))} is VALID [2022-02-21 03:06:23,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {1727#(not (<= mult_~m 0))} assume ~m - 1 >= -2147483648; {1727#(not (<= mult_~m 0))} is VALID [2022-02-21 03:06:23,111 INFO L272 TraceCheckUtils]: 10: Hoare triple {1727#(not (<= mult_~m 0))} call #t~ret5 := mult(~n, ~m - 1); {1728#(<= 0 |mult_#in~m|)} is VALID [2022-02-21 03:06:23,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {1728#(<= 0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {1726#(< 0 (+ mult_~m 1))} is VALID [2022-02-21 03:06:23,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {1726#(< 0 (+ mult_~m 1))} assume ~m < 0; {1725#false} is VALID [2022-02-21 03:06:23,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {1725#false} assume -~m <= 2147483647; {1725#false} is VALID [2022-02-21 03:06:23,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {1725#false} assume -~m >= -2147483648; {1725#false} is VALID [2022-02-21 03:06:23,115 INFO L272 TraceCheckUtils]: 15: Hoare triple {1725#false} call #t~ret4 := mult(~n, -~m); {1725#false} is VALID [2022-02-21 03:06:23,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {1725#false} ~n := #in~n;~m := #in~m; {1725#false} is VALID [2022-02-21 03:06:23,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {1725#false} assume ~m < 0; {1725#false} is VALID [2022-02-21 03:06:23,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {1725#false} assume !(-~m <= 2147483647); {1725#false} is VALID [2022-02-21 03:06:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:06:23,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:23,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991049365] [2022-02-21 03:06:23,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991049365] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:06:23,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:06:23,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:06:23,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230310753] [2022-02-21 03:06:23,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:06:23,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 03:06:23,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:23,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:23,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:23,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:06:23,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:23,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:06:23,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:06:23,132 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:23,262 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2022-02-21 03:06:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:06:23,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 03:06:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-02-21 03:06:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-02-21 03:06:23,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 69 transitions. [2022-02-21 03:06:23,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:23,314 INFO L225 Difference]: With dead ends: 133 [2022-02-21 03:06:23,314 INFO L226 Difference]: Without dead ends: 59 [2022-02-21 03:06:23,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:06:23,320 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:23,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 64 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:06:23,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-21 03:06:23,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2022-02-21 03:06:23,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:23,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 51 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:06:23,353 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 51 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:06:23,353 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 51 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:06:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:23,355 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-02-21 03:06:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-02-21 03:06:23,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:23,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:23,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 59 states. [2022-02-21 03:06:23,356 INFO L87 Difference]: Start difference. First operand has 51 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 59 states. [2022-02-21 03:06:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:23,358 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-02-21 03:06:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-02-21 03:06:23,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:23,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:23,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:23,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:06:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-02-21 03:06:23,360 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 19 [2022-02-21 03:06:23,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:23,360 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-02-21 03:06:23,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-02-21 03:06:23,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 03:06:23,361 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:23,361 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:23,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:06:23,361 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:23,362 INFO L85 PathProgramCache]: Analyzing trace with hash -773947711, now seen corresponding path program 1 times [2022-02-21 03:06:23,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:23,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029328507] [2022-02-21 03:06:23,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:23,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:23,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 03:06:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:23,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {2071#true} ~n := #in~n;~m := #in~m; {2071#true} is VALID [2022-02-21 03:06:23,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {2071#true} assume !(~m < 0); {2071#true} is VALID [2022-02-21 03:06:23,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {2071#true} assume 0 == ~m;#res := 0; {2082#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:23,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {2082#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} assume true; {2082#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:23,438 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2082#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} {2075#(<= mult_~n 2147483647)} #56#return; {2081#(and (= |mult_#t~ret5| 0) (<= mult_~n 2147483647))} is VALID [2022-02-21 03:06:23,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {2071#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {2071#true} is VALID [2022-02-21 03:06:23,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {2071#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:23,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:23,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~n~0#1 < 0); {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:23,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {2074#(<= |mult_#in~n| 2147483647)} is VALID [2022-02-21 03:06:23,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {2074#(<= |mult_#in~n| 2147483647)} ~n := #in~n;~m := #in~m; {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {2075#(<= mult_~n 2147483647)} assume !(~m < 0); {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {2075#(<= mult_~n 2147483647)} assume !(0 == ~m); {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {2075#(<= mult_~n 2147483647)} assume ~m - 1 <= 2147483647; {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {2075#(<= mult_~n 2147483647)} assume ~m - 1 >= -2147483648; {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,442 INFO L272 TraceCheckUtils]: 10: Hoare triple {2075#(<= mult_~n 2147483647)} call #t~ret5 := mult(~n, ~m - 1); {2071#true} is VALID [2022-02-21 03:06:23,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {2071#true} ~n := #in~n;~m := #in~m; {2071#true} is VALID [2022-02-21 03:06:23,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {2071#true} assume !(~m < 0); {2071#true} is VALID [2022-02-21 03:06:23,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {2071#true} assume 0 == ~m;#res := 0; {2082#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:23,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {2082#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} assume true; {2082#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:23,444 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2082#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} {2075#(<= mult_~n 2147483647)} #56#return; {2081#(and (= |mult_#t~ret5| 0) (<= mult_~n 2147483647))} is VALID [2022-02-21 03:06:23,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {2081#(and (= |mult_#t~ret5| 0) (<= mult_~n 2147483647))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2081#(and (= |mult_#t~ret5| 0) (<= mult_~n 2147483647))} is VALID [2022-02-21 03:06:23,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {2081#(and (= |mult_#t~ret5| 0) (<= mult_~n 2147483647))} assume !(~n + #t~ret5 <= 2147483647); {2072#false} is VALID [2022-02-21 03:06:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:23,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:23,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029328507] [2022-02-21 03:06:23,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029328507] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:23,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290756505] [2022-02-21 03:06:23,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:23,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:23,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:23,460 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) [2022-02-21 03:06:23,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:06:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:23,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:06:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:23,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:23,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {2071#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {2071#true} is VALID [2022-02-21 03:06:23,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {2071#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:23,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:23,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~n~0#1 < 0); {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:23,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {2074#(<= |mult_#in~n| 2147483647)} is VALID [2022-02-21 03:06:23,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {2074#(<= |mult_#in~n| 2147483647)} ~n := #in~n;~m := #in~m; {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {2075#(<= mult_~n 2147483647)} assume !(~m < 0); {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {2075#(<= mult_~n 2147483647)} assume !(0 == ~m); {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {2075#(<= mult_~n 2147483647)} assume ~m - 1 <= 2147483647; {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {2075#(<= mult_~n 2147483647)} assume ~m - 1 >= -2147483648; {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,739 INFO L272 TraceCheckUtils]: 10: Hoare triple {2075#(<= mult_~n 2147483647)} call #t~ret5 := mult(~n, ~m - 1); {2071#true} is VALID [2022-02-21 03:06:23,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {2071#true} ~n := #in~n;~m := #in~m; {2071#true} is VALID [2022-02-21 03:06:23,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {2071#true} assume !(~m < 0); {2071#true} is VALID [2022-02-21 03:06:23,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {2071#true} assume 0 == ~m;#res := 0; {2125#(<= |mult_#res| 0)} is VALID [2022-02-21 03:06:23,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {2125#(<= |mult_#res| 0)} assume true; {2125#(<= |mult_#res| 0)} is VALID [2022-02-21 03:06:23,741 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2125#(<= |mult_#res| 0)} {2075#(<= mult_~n 2147483647)} #56#return; {2132#(and (<= |mult_#t~ret5| 0) (<= mult_~n 2147483647))} is VALID [2022-02-21 03:06:23,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {2132#(and (<= |mult_#t~ret5| 0) (<= mult_~n 2147483647))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2132#(and (<= |mult_#t~ret5| 0) (<= mult_~n 2147483647))} is VALID [2022-02-21 03:06:23,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {2132#(and (<= |mult_#t~ret5| 0) (<= mult_~n 2147483647))} assume !(~n + #t~ret5 <= 2147483647); {2072#false} is VALID [2022-02-21 03:06:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:23,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:23,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {2139#(<= (+ |mult_#t~ret5| mult_~n) 2147483647)} assume !(~n + #t~ret5 <= 2147483647); {2072#false} is VALID [2022-02-21 03:06:23,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {2139#(<= (+ |mult_#t~ret5| mult_~n) 2147483647)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2139#(<= (+ |mult_#t~ret5| mult_~n) 2147483647)} is VALID [2022-02-21 03:06:23,888 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2125#(<= |mult_#res| 0)} {2075#(<= mult_~n 2147483647)} #56#return; {2139#(<= (+ |mult_#t~ret5| mult_~n) 2147483647)} is VALID [2022-02-21 03:06:23,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {2125#(<= |mult_#res| 0)} assume true; {2125#(<= |mult_#res| 0)} is VALID [2022-02-21 03:06:23,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {2071#true} assume 0 == ~m;#res := 0; {2125#(<= |mult_#res| 0)} is VALID [2022-02-21 03:06:23,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {2071#true} assume !(~m < 0); {2071#true} is VALID [2022-02-21 03:06:23,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {2071#true} ~n := #in~n;~m := #in~m; {2071#true} is VALID [2022-02-21 03:06:23,889 INFO L272 TraceCheckUtils]: 10: Hoare triple {2075#(<= mult_~n 2147483647)} call #t~ret5 := mult(~n, ~m - 1); {2071#true} is VALID [2022-02-21 03:06:23,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {2075#(<= mult_~n 2147483647)} assume ~m - 1 >= -2147483648; {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {2075#(<= mult_~n 2147483647)} assume ~m - 1 <= 2147483647; {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {2075#(<= mult_~n 2147483647)} assume !(0 == ~m); {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {2075#(<= mult_~n 2147483647)} assume !(~m < 0); {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {2074#(<= |mult_#in~n| 2147483647)} ~n := #in~n;~m := #in~m; {2075#(<= mult_~n 2147483647)} is VALID [2022-02-21 03:06:23,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {2074#(<= |mult_#in~n| 2147483647)} is VALID [2022-02-21 03:06:23,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~n~0#1 < 0); {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:23,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:23,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {2071#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2073#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:06:23,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {2071#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {2071#true} is VALID [2022-02-21 03:06:23,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:23,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290756505] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:23,895 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:23,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-02-21 03:06:23,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378222440] [2022-02-21 03:06:23,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:23,895 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2022-02-21 03:06:23,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:23,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:06:23,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:23,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 03:06:23,912 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:23,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:06:23,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:06:23,913 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:06:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:24,121 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-02-21 03:06:24,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:06:24,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2022-02-21 03:06:24,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:06:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-02-21 03:06:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:06:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-02-21 03:06:24,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 46 transitions. [2022-02-21 03:06:24,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:24,168 INFO L225 Difference]: With dead ends: 67 [2022-02-21 03:06:24,168 INFO L226 Difference]: Without dead ends: 66 [2022-02-21 03:06:24,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:06:24,169 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:24,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 85 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:06:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-21 03:06:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2022-02-21 03:06:24,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:24,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 57 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:06:24,206 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 57 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:06:24,207 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 57 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:06:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:24,209 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-02-21 03:06:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-02-21 03:06:24,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:24,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:24,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Second operand 66 states. [2022-02-21 03:06:24,211 INFO L87 Difference]: Start difference. First operand has 57 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Second operand 66 states. [2022-02-21 03:06:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:24,213 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-02-21 03:06:24,214 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-02-21 03:06:24,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:24,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:24,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:24,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:06:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2022-02-21 03:06:24,218 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 18 [2022-02-21 03:06:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:24,218 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2022-02-21 03:06:24,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:06:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-02-21 03:06:24,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:06:24,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:24,219 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:24,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 03:06:24,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:24,441 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:24,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:24,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1777424789, now seen corresponding path program 1 times [2022-02-21 03:06:24,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:24,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698292153] [2022-02-21 03:06:24,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:24,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 03:06:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {2475#true} ~n := #in~n;~m := #in~m; {2475#true} is VALID [2022-02-21 03:06:24,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {2475#true} assume !(~m < 0); {2475#true} is VALID [2022-02-21 03:06:24,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume 0 == ~m;#res := 0; {2486#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:24,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {2486#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} assume true; {2486#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:24,513 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2486#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} {2479#(<= 0 mult_~n)} #56#return; {2485#(and (= |mult_#t~ret5| 0) (<= 0 mult_~n))} is VALID [2022-02-21 03:06:24,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {2475#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {2475#true} is VALID [2022-02-21 03:06:24,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {2475#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2475#true} is VALID [2022-02-21 03:06:24,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2477#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:06:24,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {2477#(<= 0 |ULTIMATE.start_main_~m~0#1|)} assume !(main_~n~0#1 < 0); {2477#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:06:24,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {2477#(<= 0 |ULTIMATE.start_main_~m~0#1|)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {2478#(<= 0 |mult_#in~n|)} is VALID [2022-02-21 03:06:24,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {2478#(<= 0 |mult_#in~n|)} ~n := #in~n;~m := #in~m; {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {2479#(<= 0 mult_~n)} assume !(~m < 0); {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {2479#(<= 0 mult_~n)} assume !(0 == ~m); {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {2479#(<= 0 mult_~n)} assume ~m - 1 <= 2147483647; {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {2479#(<= 0 mult_~n)} assume ~m - 1 >= -2147483648; {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,517 INFO L272 TraceCheckUtils]: 10: Hoare triple {2479#(<= 0 mult_~n)} call #t~ret5 := mult(~n, ~m - 1); {2475#true} is VALID [2022-02-21 03:06:24,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#true} ~n := #in~n;~m := #in~m; {2475#true} is VALID [2022-02-21 03:06:24,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {2475#true} assume !(~m < 0); {2475#true} is VALID [2022-02-21 03:06:24,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {2475#true} assume 0 == ~m;#res := 0; {2486#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:24,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {2486#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} assume true; {2486#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:24,519 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2486#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} {2479#(<= 0 mult_~n)} #56#return; {2485#(and (= |mult_#t~ret5| 0) (<= 0 mult_~n))} is VALID [2022-02-21 03:06:24,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {2485#(and (= |mult_#t~ret5| 0) (<= 0 mult_~n))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2485#(and (= |mult_#t~ret5| 0) (<= 0 mult_~n))} is VALID [2022-02-21 03:06:24,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {2485#(and (= |mult_#t~ret5| 0) (<= 0 mult_~n))} assume ~n + #t~ret5 <= 2147483647; {2485#(and (= |mult_#t~ret5| 0) (<= 0 mult_~n))} is VALID [2022-02-21 03:06:24,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {2485#(and (= |mult_#t~ret5| 0) (<= 0 mult_~n))} assume !(~n + #t~ret5 >= -2147483648); {2476#false} is VALID [2022-02-21 03:06:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:24,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:24,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698292153] [2022-02-21 03:06:24,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698292153] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:24,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197694472] [2022-02-21 03:06:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:24,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:24,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:24,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:06:24,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:06:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:06:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:24,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {2475#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {2475#true} is VALID [2022-02-21 03:06:24,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {2475#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2475#true} is VALID [2022-02-21 03:06:24,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2477#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:06:24,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {2477#(<= 0 |ULTIMATE.start_main_~m~0#1|)} assume !(main_~n~0#1 < 0); {2477#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:06:24,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {2477#(<= 0 |ULTIMATE.start_main_~m~0#1|)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {2478#(<= 0 |mult_#in~n|)} is VALID [2022-02-21 03:06:24,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {2478#(<= 0 |mult_#in~n|)} ~n := #in~n;~m := #in~m; {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {2479#(<= 0 mult_~n)} assume !(~m < 0); {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {2479#(<= 0 mult_~n)} assume !(0 == ~m); {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {2479#(<= 0 mult_~n)} assume ~m - 1 <= 2147483647; {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {2479#(<= 0 mult_~n)} assume ~m - 1 >= -2147483648; {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,697 INFO L272 TraceCheckUtils]: 10: Hoare triple {2479#(<= 0 mult_~n)} call #t~ret5 := mult(~n, ~m - 1); {2475#true} is VALID [2022-02-21 03:06:24,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#true} ~n := #in~n;~m := #in~m; {2475#true} is VALID [2022-02-21 03:06:24,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {2475#true} assume !(~m < 0); {2475#true} is VALID [2022-02-21 03:06:24,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {2475#true} assume 0 == ~m;#res := 0; {2475#true} is VALID [2022-02-21 03:06:24,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-02-21 03:06:24,700 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2475#true} {2479#(<= 0 mult_~n)} #56#return; {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {2479#(<= 0 mult_~n)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2538#(and (<= 0 (+ |mult_#t~ret5| 2147483648)) (<= 0 mult_~n))} is VALID [2022-02-21 03:06:24,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {2538#(and (<= 0 (+ |mult_#t~ret5| 2147483648)) (<= 0 mult_~n))} assume ~n + #t~ret5 <= 2147483647; {2538#(and (<= 0 (+ |mult_#t~ret5| 2147483648)) (<= 0 mult_~n))} is VALID [2022-02-21 03:06:24,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {2538#(and (<= 0 (+ |mult_#t~ret5| 2147483648)) (<= 0 mult_~n))} assume !(~n + #t~ret5 >= -2147483648); {2476#false} is VALID [2022-02-21 03:06:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:24,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:24,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {2545#(<= 0 (+ |mult_#t~ret5| mult_~n 2147483648))} assume !(~n + #t~ret5 >= -2147483648); {2476#false} is VALID [2022-02-21 03:06:24,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {2545#(<= 0 (+ |mult_#t~ret5| mult_~n 2147483648))} assume ~n + #t~ret5 <= 2147483647; {2545#(<= 0 (+ |mult_#t~ret5| mult_~n 2147483648))} is VALID [2022-02-21 03:06:24,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {2479#(<= 0 mult_~n)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2545#(<= 0 (+ |mult_#t~ret5| mult_~n 2147483648))} is VALID [2022-02-21 03:06:24,802 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2475#true} {2479#(<= 0 mult_~n)} #56#return; {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-02-21 03:06:24,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {2475#true} assume 0 == ~m;#res := 0; {2475#true} is VALID [2022-02-21 03:06:24,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {2475#true} assume !(~m < 0); {2475#true} is VALID [2022-02-21 03:06:24,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#true} ~n := #in~n;~m := #in~m; {2475#true} is VALID [2022-02-21 03:06:24,802 INFO L272 TraceCheckUtils]: 10: Hoare triple {2479#(<= 0 mult_~n)} call #t~ret5 := mult(~n, ~m - 1); {2475#true} is VALID [2022-02-21 03:06:24,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {2479#(<= 0 mult_~n)} assume ~m - 1 >= -2147483648; {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {2479#(<= 0 mult_~n)} assume ~m - 1 <= 2147483647; {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {2479#(<= 0 mult_~n)} assume !(0 == ~m); {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {2479#(<= 0 mult_~n)} assume !(~m < 0); {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {2478#(<= 0 |mult_#in~n|)} ~n := #in~n;~m := #in~m; {2479#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:24,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {2477#(<= 0 |ULTIMATE.start_main_~m~0#1|)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {2478#(<= 0 |mult_#in~n|)} is VALID [2022-02-21 03:06:24,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {2477#(<= 0 |ULTIMATE.start_main_~m~0#1|)} assume !(main_~n~0#1 < 0); {2477#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:06:24,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2477#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:06:24,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {2475#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2475#true} is VALID [2022-02-21 03:06:24,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {2475#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {2475#true} is VALID [2022-02-21 03:06:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:24,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197694472] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:24,809 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:24,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-02-21 03:06:24,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515495388] [2022-02-21 03:06:24,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:24,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-21 03:06:24,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:24,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:06:24,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:24,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 03:06:24,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:24,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:06:24,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:06:24,827 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:06:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:25,009 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-02-21 03:06:25,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:06:25,010 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-21 03:06:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:06:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-02-21 03:06:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:06:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-02-21 03:06:25,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2022-02-21 03:06:25,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:25,043 INFO L225 Difference]: With dead ends: 65 [2022-02-21 03:06:25,043 INFO L226 Difference]: Without dead ends: 64 [2022-02-21 03:06:25,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:06:25,044 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:25,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 102 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:06:25,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-21 03:06:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2022-02-21 03:06:25,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:25,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 57 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:06:25,072 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 57 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:06:25,072 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 57 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:06:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:25,074 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-02-21 03:06:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-02-21 03:06:25,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:25,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:25,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Second operand 64 states. [2022-02-21 03:06:25,075 INFO L87 Difference]: Start difference. First operand has 57 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Second operand 64 states. [2022-02-21 03:06:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:25,076 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-02-21 03:06:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-02-21 03:06:25,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:25,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:25,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:25,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:06:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2022-02-21 03:06:25,079 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 19 [2022-02-21 03:06:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:25,079 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2022-02-21 03:06:25,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:06:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-02-21 03:06:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 03:06:25,080 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:25,080 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:25,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:06:25,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-02-21 03:06:25,304 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:25,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:25,304 INFO L85 PathProgramCache]: Analyzing trace with hash -211759156, now seen corresponding path program 1 times [2022-02-21 03:06:25,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:25,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405582840] [2022-02-21 03:06:25,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:25,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:25,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:06:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:25,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {2878#true} ~n := #in~n;~m := #in~m; {2894#(= |mult_#in~m| mult_~m)} is VALID [2022-02-21 03:06:25,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {2894#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {2894#(= |mult_#in~m| mult_~m)} is VALID [2022-02-21 03:06:25,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {2894#(= |mult_#in~m| mult_~m)} assume 0 == ~m;#res := 0; {2895#(<= |mult_#in~m| 0)} is VALID [2022-02-21 03:06:25,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {2895#(<= |mult_#in~m| 0)} assume true; {2895#(<= |mult_#in~m| 0)} is VALID [2022-02-21 03:06:25,375 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2895#(<= |mult_#in~m| 0)} {2878#true} #58#return; {2885#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:06:25,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-21 03:06:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:25,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {2878#true} ~n := #in~n;~m := #in~m; {2878#true} is VALID [2022-02-21 03:06:25,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {2878#true} assume !(~m < 0); {2878#true} is VALID [2022-02-21 03:06:25,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume 0 == ~m;#res := 0; {2896#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:25,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {2896#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} assume true; {2896#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:25,397 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2896#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} {2887#(<= mult_~n 0)} #56#return; {2893#(and (<= mult_~n 0) (= |mult_#t~ret5| 0))} is VALID [2022-02-21 03:06:25,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {2878#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {2878#true} is VALID [2022-02-21 03:06:25,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {2878#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2878#true} is VALID [2022-02-21 03:06:25,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2878#true} is VALID [2022-02-21 03:06:25,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {2878#true} assume !(main_~n~0#1 < 0); {2878#true} is VALID [2022-02-21 03:06:25,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {2878#true} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {2878#true} is VALID [2022-02-21 03:06:25,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {2878#true} ~n := #in~n;~m := #in~m; {2894#(= |mult_#in~m| mult_~m)} is VALID [2022-02-21 03:06:25,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {2894#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {2894#(= |mult_#in~m| mult_~m)} is VALID [2022-02-21 03:06:25,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {2894#(= |mult_#in~m| mult_~m)} assume 0 == ~m;#res := 0; {2895#(<= |mult_#in~m| 0)} is VALID [2022-02-21 03:06:25,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {2895#(<= |mult_#in~m| 0)} assume true; {2895#(<= |mult_#in~m| 0)} is VALID [2022-02-21 03:06:25,400 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2895#(<= |mult_#in~m| 0)} {2878#true} #58#return; {2885#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:06:25,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {2885#(<= |ULTIMATE.start_main_~n~0#1| 0)} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~res1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {2885#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:06:25,401 INFO L272 TraceCheckUtils]: 11: Hoare triple {2885#(<= |ULTIMATE.start_main_~n~0#1| 0)} call main_#t~ret9#1 := mult(main_~n~0#1, main_~m~0#1); {2886#(<= |mult_#in~n| 0)} is VALID [2022-02-21 03:06:25,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {2886#(<= |mult_#in~n| 0)} ~n := #in~n;~m := #in~m; {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {2887#(<= mult_~n 0)} assume !(~m < 0); {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {2887#(<= mult_~n 0)} assume !(0 == ~m); {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {2887#(<= mult_~n 0)} assume ~m - 1 <= 2147483647; {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {2887#(<= mult_~n 0)} assume ~m - 1 >= -2147483648; {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,403 INFO L272 TraceCheckUtils]: 17: Hoare triple {2887#(<= mult_~n 0)} call #t~ret5 := mult(~n, ~m - 1); {2878#true} is VALID [2022-02-21 03:06:25,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#true} ~n := #in~n;~m := #in~m; {2878#true} is VALID [2022-02-21 03:06:25,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {2878#true} assume !(~m < 0); {2878#true} is VALID [2022-02-21 03:06:25,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {2878#true} assume 0 == ~m;#res := 0; {2896#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:25,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {2896#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} assume true; {2896#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:25,405 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2896#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} {2887#(<= mult_~n 0)} #56#return; {2893#(and (<= mult_~n 0) (= |mult_#t~ret5| 0))} is VALID [2022-02-21 03:06:25,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {2893#(and (<= mult_~n 0) (= |mult_#t~ret5| 0))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2893#(and (<= mult_~n 0) (= |mult_#t~ret5| 0))} is VALID [2022-02-21 03:06:25,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {2893#(and (<= mult_~n 0) (= |mult_#t~ret5| 0))} assume !(~n + #t~ret5 <= 2147483647); {2879#false} is VALID [2022-02-21 03:06:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:06:25,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:25,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405582840] [2022-02-21 03:06:25,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405582840] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:25,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323898185] [2022-02-21 03:06:25,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:25,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:25,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:25,409 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) [2022-02-21 03:06:25,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:06:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:25,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:06:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:25,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:25,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {2878#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {2878#true} is VALID [2022-02-21 03:06:25,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {2878#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2878#true} is VALID [2022-02-21 03:06:25,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2878#true} is VALID [2022-02-21 03:06:25,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {2878#true} assume !(main_~n~0#1 < 0); {2878#true} is VALID [2022-02-21 03:06:25,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {2878#true} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {2878#true} is VALID [2022-02-21 03:06:25,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {2878#true} ~n := #in~n;~m := #in~m; {2915#(<= |mult_#in~m| mult_~m)} is VALID [2022-02-21 03:06:25,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {2915#(<= |mult_#in~m| mult_~m)} assume !(~m < 0); {2915#(<= |mult_#in~m| mult_~m)} is VALID [2022-02-21 03:06:25,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {2915#(<= |mult_#in~m| mult_~m)} assume 0 == ~m;#res := 0; {2895#(<= |mult_#in~m| 0)} is VALID [2022-02-21 03:06:25,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {2895#(<= |mult_#in~m| 0)} assume true; {2895#(<= |mult_#in~m| 0)} is VALID [2022-02-21 03:06:25,582 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2895#(<= |mult_#in~m| 0)} {2878#true} #58#return; {2885#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:06:25,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {2885#(<= |ULTIMATE.start_main_~n~0#1| 0)} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~res1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {2885#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:06:25,583 INFO L272 TraceCheckUtils]: 11: Hoare triple {2885#(<= |ULTIMATE.start_main_~n~0#1| 0)} call main_#t~ret9#1 := mult(main_~n~0#1, main_~m~0#1); {2886#(<= |mult_#in~n| 0)} is VALID [2022-02-21 03:06:25,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {2886#(<= |mult_#in~n| 0)} ~n := #in~n;~m := #in~m; {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {2887#(<= mult_~n 0)} assume !(~m < 0); {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {2887#(<= mult_~n 0)} assume !(0 == ~m); {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {2887#(<= mult_~n 0)} assume ~m - 1 <= 2147483647; {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {2887#(<= mult_~n 0)} assume ~m - 1 >= -2147483648; {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,584 INFO L272 TraceCheckUtils]: 17: Hoare triple {2887#(<= mult_~n 0)} call #t~ret5 := mult(~n, ~m - 1); {2878#true} is VALID [2022-02-21 03:06:25,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#true} ~n := #in~n;~m := #in~m; {2878#true} is VALID [2022-02-21 03:06:25,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {2878#true} assume !(~m < 0); {2878#true} is VALID [2022-02-21 03:06:25,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {2878#true} assume 0 == ~m;#res := 0; {2878#true} is VALID [2022-02-21 03:06:25,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-02-21 03:06:25,585 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2878#true} {2887#(<= mult_~n 0)} #56#return; {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {2887#(<= mult_~n 0)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2970#(and (<= mult_~n 0) (<= |mult_#t~ret5| 2147483647))} is VALID [2022-02-21 03:06:25,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {2970#(and (<= mult_~n 0) (<= |mult_#t~ret5| 2147483647))} assume !(~n + #t~ret5 <= 2147483647); {2879#false} is VALID [2022-02-21 03:06:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:06:25,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:25,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {2974#(<= (+ |mult_#t~ret5| mult_~n) 2147483647)} assume !(~n + #t~ret5 <= 2147483647); {2879#false} is VALID [2022-02-21 03:06:25,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {2887#(<= mult_~n 0)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2974#(<= (+ |mult_#t~ret5| mult_~n) 2147483647)} is VALID [2022-02-21 03:06:25,828 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2878#true} {2887#(<= mult_~n 0)} #56#return; {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-02-21 03:06:25,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {2878#true} assume 0 == ~m;#res := 0; {2878#true} is VALID [2022-02-21 03:06:25,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {2878#true} assume !(~m < 0); {2878#true} is VALID [2022-02-21 03:06:25,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#true} ~n := #in~n;~m := #in~m; {2878#true} is VALID [2022-02-21 03:06:25,828 INFO L272 TraceCheckUtils]: 17: Hoare triple {2887#(<= mult_~n 0)} call #t~ret5 := mult(~n, ~m - 1); {2878#true} is VALID [2022-02-21 03:06:25,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {2887#(<= mult_~n 0)} assume ~m - 1 >= -2147483648; {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {2887#(<= mult_~n 0)} assume ~m - 1 <= 2147483647; {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {2887#(<= mult_~n 0)} assume !(0 == ~m); {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {2887#(<= mult_~n 0)} assume !(~m < 0); {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {2886#(<= |mult_#in~n| 0)} ~n := #in~n;~m := #in~m; {2887#(<= mult_~n 0)} is VALID [2022-02-21 03:06:25,831 INFO L272 TraceCheckUtils]: 11: Hoare triple {2885#(<= |ULTIMATE.start_main_~n~0#1| 0)} call main_#t~ret9#1 := mult(main_~n~0#1, main_~m~0#1); {2886#(<= |mult_#in~n| 0)} is VALID [2022-02-21 03:06:25,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {2885#(<= |ULTIMATE.start_main_~n~0#1| 0)} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~res1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {2885#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:06:25,832 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2895#(<= |mult_#in~m| 0)} {2878#true} #58#return; {2885#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:06:25,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {2895#(<= |mult_#in~m| 0)} assume true; {2895#(<= |mult_#in~m| 0)} is VALID [2022-02-21 03:06:25,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {3029#(or (not (<= mult_~m 0)) (<= |mult_#in~m| 0))} assume 0 == ~m;#res := 0; {2895#(<= |mult_#in~m| 0)} is VALID [2022-02-21 03:06:25,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {3029#(or (not (<= mult_~m 0)) (<= |mult_#in~m| 0))} assume !(~m < 0); {3029#(or (not (<= mult_~m 0)) (<= |mult_#in~m| 0))} is VALID [2022-02-21 03:06:25,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {2878#true} ~n := #in~n;~m := #in~m; {3029#(or (not (<= mult_~m 0)) (<= |mult_#in~m| 0))} is VALID [2022-02-21 03:06:25,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {2878#true} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {2878#true} is VALID [2022-02-21 03:06:25,834 INFO L290 TraceCheckUtils]: 3: Hoare triple {2878#true} assume !(main_~n~0#1 < 0); {2878#true} is VALID [2022-02-21 03:06:25,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2878#true} is VALID [2022-02-21 03:06:25,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {2878#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2878#true} is VALID [2022-02-21 03:06:25,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {2878#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {2878#true} is VALID [2022-02-21 03:06:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:06:25,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323898185] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:25,835 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:25,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-02-21 03:06:25,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180050162] [2022-02-21 03:06:25,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:25,836 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-21 03:06:25,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:25,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:25,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:25,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-21 03:06:25,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:25,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:06:25,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:06:25,859 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:26,265 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2022-02-21 03:06:26,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:06:26,265 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-21 03:06:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 48 transitions. [2022-02-21 03:06:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 48 transitions. [2022-02-21 03:06:26,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 48 transitions. [2022-02-21 03:06:26,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:26,328 INFO L225 Difference]: With dead ends: 94 [2022-02-21 03:06:26,328 INFO L226 Difference]: Without dead ends: 93 [2022-02-21 03:06:26,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:06:26,329 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:26,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 94 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:06:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-21 03:06:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2022-02-21 03:06:26,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:26,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 80 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 63 states have internal predecessors, (73), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2022-02-21 03:06:26,370 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 80 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 63 states have internal predecessors, (73), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2022-02-21 03:06:26,370 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 80 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 63 states have internal predecessors, (73), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2022-02-21 03:06:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:26,374 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2022-02-21 03:06:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2022-02-21 03:06:26,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:26,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:26,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 63 states have internal predecessors, (73), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) Second operand 93 states. [2022-02-21 03:06:26,375 INFO L87 Difference]: Start difference. First operand has 80 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 63 states have internal predecessors, (73), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) Second operand 93 states. [2022-02-21 03:06:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:26,377 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2022-02-21 03:06:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2022-02-21 03:06:26,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:26,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:26,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:26,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 63 states have internal predecessors, (73), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2022-02-21 03:06:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2022-02-21 03:06:26,380 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 25 [2022-02-21 03:06:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:26,381 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2022-02-21 03:06:26,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2022-02-21 03:06:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 03:06:26,382 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:26,382 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:26,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:06:26,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:26,604 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:26,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:26,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2025400810, now seen corresponding path program 1 times [2022-02-21 03:06:26,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:26,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261193895] [2022-02-21 03:06:26,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:26,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:26,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:06:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:26,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {3450#true} ~n := #in~n;~m := #in~m; {3450#true} is VALID [2022-02-21 03:06:26,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {3450#true} assume !(~m < 0); {3450#true} is VALID [2022-02-21 03:06:26,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {3450#true} assume 0 == ~m;#res := 0; {3450#true} is VALID [2022-02-21 03:06:26,668 INFO L290 TraceCheckUtils]: 3: Hoare triple {3450#true} assume true; {3450#true} is VALID [2022-02-21 03:06:26,669 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3450#true} {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} #58#return; {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 03:06:26,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-21 03:06:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:26,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {3450#true} ~n := #in~n;~m := #in~m; {3450#true} is VALID [2022-02-21 03:06:26,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {3450#true} assume !(~m < 0); {3450#true} is VALID [2022-02-21 03:06:26,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {3450#true} assume 0 == ~m;#res := 0; {3466#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:26,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {3466#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} assume true; {3466#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:26,685 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3466#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} {3459#(<= 0 mult_~n)} #56#return; {3465#(and (= |mult_#t~ret5| 0) (<= 0 mult_~n))} is VALID [2022-02-21 03:06:26,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {3450#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {3450#true} is VALID [2022-02-21 03:06:26,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {3450#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3450#true} is VALID [2022-02-21 03:06:26,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {3450#true} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {3450#true} is VALID [2022-02-21 03:06:26,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {3450#true} assume !(main_~n~0#1 < 0); {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 03:06:26,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {3450#true} is VALID [2022-02-21 03:06:26,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {3450#true} ~n := #in~n;~m := #in~m; {3450#true} is VALID [2022-02-21 03:06:26,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {3450#true} assume !(~m < 0); {3450#true} is VALID [2022-02-21 03:06:26,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {3450#true} assume 0 == ~m;#res := 0; {3450#true} is VALID [2022-02-21 03:06:26,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {3450#true} assume true; {3450#true} is VALID [2022-02-21 03:06:26,687 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3450#true} {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} #58#return; {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 03:06:26,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~res1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 03:06:26,688 INFO L272 TraceCheckUtils]: 11: Hoare triple {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} call main_#t~ret9#1 := mult(main_~n~0#1, main_~m~0#1); {3458#(<= 0 |mult_#in~n|)} is VALID [2022-02-21 03:06:26,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {3458#(<= 0 |mult_#in~n|)} ~n := #in~n;~m := #in~m; {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {3459#(<= 0 mult_~n)} assume !(~m < 0); {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {3459#(<= 0 mult_~n)} assume !(0 == ~m); {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {3459#(<= 0 mult_~n)} assume ~m - 1 <= 2147483647; {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {3459#(<= 0 mult_~n)} assume ~m - 1 >= -2147483648; {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,689 INFO L272 TraceCheckUtils]: 17: Hoare triple {3459#(<= 0 mult_~n)} call #t~ret5 := mult(~n, ~m - 1); {3450#true} is VALID [2022-02-21 03:06:26,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {3450#true} ~n := #in~n;~m := #in~m; {3450#true} is VALID [2022-02-21 03:06:26,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {3450#true} assume !(~m < 0); {3450#true} is VALID [2022-02-21 03:06:26,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {3450#true} assume 0 == ~m;#res := 0; {3466#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:26,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {3466#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} assume true; {3466#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} is VALID [2022-02-21 03:06:26,691 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3466#(and (<= 0 |mult_#res|) (<= |mult_#res| 0))} {3459#(<= 0 mult_~n)} #56#return; {3465#(and (= |mult_#t~ret5| 0) (<= 0 mult_~n))} is VALID [2022-02-21 03:06:26,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {3465#(and (= |mult_#t~ret5| 0) (<= 0 mult_~n))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3465#(and (= |mult_#t~ret5| 0) (<= 0 mult_~n))} is VALID [2022-02-21 03:06:26,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {3465#(and (= |mult_#t~ret5| 0) (<= 0 mult_~n))} assume ~n + #t~ret5 <= 2147483647; {3465#(and (= |mult_#t~ret5| 0) (<= 0 mult_~n))} is VALID [2022-02-21 03:06:26,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {3465#(and (= |mult_#t~ret5| 0) (<= 0 mult_~n))} assume !(~n + #t~ret5 >= -2147483648); {3451#false} is VALID [2022-02-21 03:06:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:06:26,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:26,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261193895] [2022-02-21 03:06:26,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261193895] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:26,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595100209] [2022-02-21 03:06:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:26,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:26,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:26,694 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) [2022-02-21 03:06:26,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:06:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:26,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:06:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:26,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:26,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {3450#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {3450#true} is VALID [2022-02-21 03:06:26,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {3450#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3450#true} is VALID [2022-02-21 03:06:26,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {3450#true} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {3450#true} is VALID [2022-02-21 03:06:26,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {3450#true} assume !(main_~n~0#1 < 0); {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 03:06:26,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {3450#true} is VALID [2022-02-21 03:06:26,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {3450#true} ~n := #in~n;~m := #in~m; {3450#true} is VALID [2022-02-21 03:06:26,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {3450#true} assume !(~m < 0); {3450#true} is VALID [2022-02-21 03:06:26,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {3450#true} assume 0 == ~m;#res := 0; {3450#true} is VALID [2022-02-21 03:06:26,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {3450#true} assume true; {3450#true} is VALID [2022-02-21 03:06:26,853 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3450#true} {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} #58#return; {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 03:06:26,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~res1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 03:06:26,854 INFO L272 TraceCheckUtils]: 11: Hoare triple {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} call main_#t~ret9#1 := mult(main_~n~0#1, main_~m~0#1); {3458#(<= 0 |mult_#in~n|)} is VALID [2022-02-21 03:06:26,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {3458#(<= 0 |mult_#in~n|)} ~n := #in~n;~m := #in~m; {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {3459#(<= 0 mult_~n)} assume !(~m < 0); {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {3459#(<= 0 mult_~n)} assume !(0 == ~m); {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {3459#(<= 0 mult_~n)} assume ~m - 1 <= 2147483647; {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {3459#(<= 0 mult_~n)} assume ~m - 1 >= -2147483648; {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,856 INFO L272 TraceCheckUtils]: 17: Hoare triple {3459#(<= 0 mult_~n)} call #t~ret5 := mult(~n, ~m - 1); {3450#true} is VALID [2022-02-21 03:06:26,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {3450#true} ~n := #in~n;~m := #in~m; {3450#true} is VALID [2022-02-21 03:06:26,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {3450#true} assume !(~m < 0); {3450#true} is VALID [2022-02-21 03:06:26,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {3450#true} assume 0 == ~m;#res := 0; {3450#true} is VALID [2022-02-21 03:06:26,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {3450#true} assume true; {3450#true} is VALID [2022-02-21 03:06:26,856 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3450#true} {3459#(<= 0 mult_~n)} #56#return; {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {3459#(<= 0 mult_~n)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3539#(and (<= 0 (+ |mult_#t~ret5| 2147483648)) (<= 0 mult_~n))} is VALID [2022-02-21 03:06:26,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {3539#(and (<= 0 (+ |mult_#t~ret5| 2147483648)) (<= 0 mult_~n))} assume ~n + #t~ret5 <= 2147483647; {3539#(and (<= 0 (+ |mult_#t~ret5| 2147483648)) (<= 0 mult_~n))} is VALID [2022-02-21 03:06:26,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {3539#(and (<= 0 (+ |mult_#t~ret5| 2147483648)) (<= 0 mult_~n))} assume !(~n + #t~ret5 >= -2147483648); {3451#false} is VALID [2022-02-21 03:06:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:06:26,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:26,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {3546#(<= 0 (+ |mult_#t~ret5| mult_~n 2147483648))} assume !(~n + #t~ret5 >= -2147483648); {3451#false} is VALID [2022-02-21 03:06:26,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {3546#(<= 0 (+ |mult_#t~ret5| mult_~n 2147483648))} assume ~n + #t~ret5 <= 2147483647; {3546#(<= 0 (+ |mult_#t~ret5| mult_~n 2147483648))} is VALID [2022-02-21 03:06:26,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {3459#(<= 0 mult_~n)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3546#(<= 0 (+ |mult_#t~ret5| mult_~n 2147483648))} is VALID [2022-02-21 03:06:26,962 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3450#true} {3459#(<= 0 mult_~n)} #56#return; {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {3450#true} assume true; {3450#true} is VALID [2022-02-21 03:06:26,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {3450#true} assume 0 == ~m;#res := 0; {3450#true} is VALID [2022-02-21 03:06:26,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {3450#true} assume !(~m < 0); {3450#true} is VALID [2022-02-21 03:06:26,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {3450#true} ~n := #in~n;~m := #in~m; {3450#true} is VALID [2022-02-21 03:06:26,962 INFO L272 TraceCheckUtils]: 17: Hoare triple {3459#(<= 0 mult_~n)} call #t~ret5 := mult(~n, ~m - 1); {3450#true} is VALID [2022-02-21 03:06:26,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {3459#(<= 0 mult_~n)} assume ~m - 1 >= -2147483648; {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {3459#(<= 0 mult_~n)} assume ~m - 1 <= 2147483647; {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {3459#(<= 0 mult_~n)} assume !(0 == ~m); {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {3459#(<= 0 mult_~n)} assume !(~m < 0); {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {3458#(<= 0 |mult_#in~n|)} ~n := #in~n;~m := #in~m; {3459#(<= 0 mult_~n)} is VALID [2022-02-21 03:06:26,966 INFO L272 TraceCheckUtils]: 11: Hoare triple {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} call main_#t~ret9#1 := mult(main_~n~0#1, main_~m~0#1); {3458#(<= 0 |mult_#in~n|)} is VALID [2022-02-21 03:06:26,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~res1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 03:06:26,972 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3450#true} {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} #58#return; {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 03:06:26,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {3450#true} assume true; {3450#true} is VALID [2022-02-21 03:06:26,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {3450#true} assume 0 == ~m;#res := 0; {3450#true} is VALID [2022-02-21 03:06:26,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {3450#true} assume !(~m < 0); {3450#true} is VALID [2022-02-21 03:06:26,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {3450#true} ~n := #in~n;~m := #in~m; {3450#true} is VALID [2022-02-21 03:06:26,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {3450#true} is VALID [2022-02-21 03:06:26,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {3450#true} assume !(main_~n~0#1 < 0); {3452#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 03:06:26,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {3450#true} assume !(main_~m~0#1 < 0);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {3450#true} is VALID [2022-02-21 03:06:26,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {3450#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3450#true} is VALID [2022-02-21 03:06:26,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {3450#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {3450#true} is VALID [2022-02-21 03:06:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:06:26,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595100209] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:26,974 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:26,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-02-21 03:06:26,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586287876] [2022-02-21 03:06:26,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:26,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-02-21 03:06:26,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:26,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:27,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:27,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 03:06:27,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:27,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:06:27,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:06:27,011 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:27,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:27,238 INFO L93 Difference]: Finished difference Result 97 states and 113 transitions. [2022-02-21 03:06:27,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:06:27,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-02-21 03:06:27,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:27,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-02-21 03:06:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-02-21 03:06:27,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2022-02-21 03:06:27,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:27,277 INFO L225 Difference]: With dead ends: 97 [2022-02-21 03:06:27,277 INFO L226 Difference]: Without dead ends: 64 [2022-02-21 03:06:27,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:06:27,278 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:27,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 147 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:06:27,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-21 03:06:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-02-21 03:06:27,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:27,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 55 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 43 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:06:27,310 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 55 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 43 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:06:27,310 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 55 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 43 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:06:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:27,312 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-02-21 03:06:27,312 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-02-21 03:06:27,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:27,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:27,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 43 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Second operand 64 states. [2022-02-21 03:06:27,313 INFO L87 Difference]: Start difference. First operand has 55 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 43 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Second operand 64 states. [2022-02-21 03:06:27,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:27,315 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-02-21 03:06:27,315 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-02-21 03:06:27,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:27,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:27,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:27,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 43 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:06:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-02-21 03:06:27,317 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 26 [2022-02-21 03:06:27,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:27,317 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-02-21 03:06:27,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-02-21 03:06:27,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-21 03:06:27,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:27,318 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:27,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:06:27,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:27,531 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:27,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:27,532 INFO L85 PathProgramCache]: Analyzing trace with hash 360381511, now seen corresponding path program 1 times [2022-02-21 03:06:27,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:27,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951183559] [2022-02-21 03:06:27,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:27,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:06:27,554 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:06:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:06:27,596 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:06:27,596 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 03:06:27,597 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-02-21 03:06:27,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-02-21 03:06:27,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-02-21 03:06:27,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-02-21 03:06:27,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-02-21 03:06:27,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-02-21 03:06:27,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-21 03:06:27,602 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:27,604 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:06:27,620 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret8 := mult(~m~0, ~n~0); [2022-02-21 03:06:27,621 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:06:27,628 INFO L158 Benchmark]: Toolchain (without parser) took 7501.81ms. Allocated memory was 81.8MB in the beginning and 146.8MB in the end (delta: 65.0MB). Free memory was 47.6MB in the beginning and 61.7MB in the end (delta: -14.1MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2022-02-21 03:06:27,628 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory was 54.1MB in the beginning and 54.0MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:06:27,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.37ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 47.3MB in the beginning and 74.9MB in the end (delta: -27.6MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-21 03:06:27,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.77ms. Allocated memory is still 98.6MB. Free memory was 74.9MB in the beginning and 73.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:06:27,629 INFO L158 Benchmark]: Boogie Preprocessor took 13.24ms. Allocated memory is still 98.6MB. Free memory was 73.2MB in the beginning and 72.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:06:27,629 INFO L158 Benchmark]: RCFGBuilder took 353.78ms. Allocated memory is still 98.6MB. Free memory was 72.1MB in the beginning and 60.0MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:06:27,629 INFO L158 Benchmark]: TraceAbstraction took 6822.01ms. Allocated memory was 98.6MB in the beginning and 146.8MB in the end (delta: 48.2MB). Free memory was 59.6MB in the beginning and 61.7MB in the end (delta: -2.1MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2022-02-21 03:06:27,630 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory was 54.1MB in the beginning and 54.0MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.37ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 47.3MB in the beginning and 74.9MB in the end (delta: -27.6MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.77ms. Allocated memory is still 98.6MB. Free memory was 74.9MB in the beginning and 73.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.24ms. Allocated memory is still 98.6MB. Free memory was 73.2MB in the beginning and 72.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 353.78ms. Allocated memory is still 98.6MB. Free memory was 72.1MB in the beginning and 60.0MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6822.01ms. Allocated memory was 98.6MB in the beginning and 146.8MB in the end (delta: 48.2MB). Free memory was 59.6MB in the beginning and 61.7MB in the end (delta: -2.1MB). Peak memory consumption was 45.3MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:06:27,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*64bit*_Bitvector*.epf No suitable settings file found using Overflow*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator