./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1c.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-crafted/NestedRecursion_1c.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 f5c626d5135dc189cbc332c41f07b76804a58f47ee910790099695b0d83f1587 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:02:35,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:02:35,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:02:35,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:02:35,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:02:35,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:02:35,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:02:35,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:02:35,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:02:35,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:02:35,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:02:35,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:02:35,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:02:35,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:02:35,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:02:35,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:02:35,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:02:35,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:02:35,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:02:35,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:02:35,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:02:35,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:02:35,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:02:35,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:02:35,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:02:35,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:02:35,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:02:35,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:02:35,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:02:35,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:02:35,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:02:35,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:02:35,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:02:35,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:02:35,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:02:35,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:02:35,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:02:35,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:02:35,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:02:35,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:02:35,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:02:35,549 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:02:35,569 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:02:35,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:02:35,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:02:35,570 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:02:35,571 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:02:35,578 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:02:35,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:02:35,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:02:35,580 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:02:35,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:02:35,581 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:02:35,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:02:35,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:02:35,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:02:35,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:02:35,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:02:35,582 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:02:35,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:02:35,582 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:02:35,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:02:35,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:02:35,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:02:35,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:02:35,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:02:35,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:02:35,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:02:35,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:02:35,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:02:35,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:02:35,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:02:35,585 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 -> f5c626d5135dc189cbc332c41f07b76804a58f47ee910790099695b0d83f1587 [2022-02-21 03:02:35,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:02:35,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:02:35,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:02:35,829 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:02:35,830 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:02:35,831 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1c.c [2022-02-21 03:02:35,890 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d4e1a69/b9890f07884f41fa81e691bbaade1df7/FLAG37c1c312a [2022-02-21 03:02:36,260 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:02:36,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1c.c [2022-02-21 03:02:36,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d4e1a69/b9890f07884f41fa81e691bbaade1df7/FLAG37c1c312a [2022-02-21 03:02:36,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d4e1a69/b9890f07884f41fa81e691bbaade1df7 [2022-02-21 03:02:36,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:02:36,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:02:36,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:02:36,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:02:36,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:02:36,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3713dd7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36, skipping insertion in model container [2022-02-21 03:02:36,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:02:36,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:02:36,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:02:36,482 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:02:36,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:02:36,518 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:02:36,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36 WrapperNode [2022-02-21 03:02:36,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:02:36,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:02:36,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:02:36,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:02:36,525 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:02:36" (1/1) ... [2022-02-21 03:02:36,529 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:02:36" (1/1) ... [2022-02-21 03:02:36,540 INFO L137 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 8 [2022-02-21 03:02:36,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:02:36,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:02:36,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:02:36,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:02:36,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:02:36,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:02:36,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:02:36,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:02:36,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:02:36,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:36,589 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:02:36,598 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:02:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2022-02-21 03:02:36,622 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2022-02-21 03:02:36,622 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2022-02-21 03:02:36,622 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2022-02-21 03:02:36,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:02:36,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:02:36,664 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:02:36,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:02:36,851 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:02:36,857 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:02:36,857 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:02:36,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:36 BoogieIcfgContainer [2022-02-21 03:02:36,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:02:36,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:02:36,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:02:36,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:02:36,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:02:36" (1/3) ... [2022-02-21 03:02:36,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ea3254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:02:36, skipping insertion in model container [2022-02-21 03:02:36,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (2/3) ... [2022-02-21 03:02:36,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ea3254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:02:36, skipping insertion in model container [2022-02-21 03:02:36,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:36" (3/3) ... [2022-02-21 03:02:36,871 INFO L111 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1c.c [2022-02-21 03:02:36,875 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:02:36,875 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-02-21 03:02:36,921 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:02:36,929 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:02:36,929 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-21 03:02:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 36 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:02:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:02:36,959 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:36,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:02:36,961 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:36,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:36,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2132374368, now seen corresponding path program 1 times [2022-02-21 03:02:36,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:36,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221455830] [2022-02-21 03:02:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:36,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:37,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#true} assume { :begin_inline_ULTIMATE.init } true; {48#true} is VALID [2022-02-21 03:02:37,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {50#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:02:37,169 INFO L272 TraceCheckUtils]: 2: Hoare triple {50#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} call main_#t~ret6#1 := rec2(main_~x~0#1); {51#(<= |rec2_#in~j| 2147483647)} is VALID [2022-02-21 03:02:37,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {51#(<= |rec2_#in~j| 2147483647)} ~j := #in~j; {52#(<= rec2_~j 2147483647)} is VALID [2022-02-21 03:02:37,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {52#(<= rec2_~j 2147483647)} assume !(~j <= 0); {52#(<= rec2_~j 2147483647)} is VALID [2022-02-21 03:02:37,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {52#(<= rec2_~j 2147483647)} assume !(~j - 1 <= 2147483647); {49#false} is VALID [2022-02-21 03:02:37,172 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:02:37,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:37,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221455830] [2022-02-21 03:02:37,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221455830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:37,174 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:37,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:02:37,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804631646] [2022-02-21 03:02:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:37,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 6 [2022-02-21 03:02:37,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:37,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:02:37,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:37,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:02:37,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:37,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:02:37,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:02:37,212 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 36 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:02:37,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:37,426 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-02-21 03:02:37,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:02:37,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 6 [2022-02-21 03:02:37,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:02:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-02-21 03:02:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:02:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-02-21 03:02:37,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-02-21 03:02:37,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:37,501 INFO L225 Difference]: With dead ends: 45 [2022-02-21 03:02:37,502 INFO L226 Difference]: Without dead ends: 40 [2022-02-21 03:02:37,504 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:02:37,508 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 27 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:37,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 140 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:37,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-21 03:02:37,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-21 03:02:37,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:37,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:37,541 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:37,542 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:37,547 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-02-21 03:02:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-02-21 03:02:37,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:37,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:37,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-02-21 03:02:37,549 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-02-21 03:02:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:37,554 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-02-21 03:02:37,554 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-02-21 03:02:37,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:37,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:37,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:37,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-02-21 03:02:37,560 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 6 [2022-02-21 03:02:37,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:37,560 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-02-21 03:02:37,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:02:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-02-21 03:02:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:02:37,561 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:37,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:37,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:02:37,562 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:37,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:37,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1679096030, now seen corresponding path program 1 times [2022-02-21 03:02:37,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:37,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175096963] [2022-02-21 03:02:37,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:37,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:37,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {238#true} assume { :begin_inline_ULTIMATE.init } true; {238#true} is VALID [2022-02-21 03:02:37,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {238#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {238#true} is VALID [2022-02-21 03:02:37,584 INFO L272 TraceCheckUtils]: 2: Hoare triple {238#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {238#true} is VALID [2022-02-21 03:02:37,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {238#true} ~j := #in~j; {238#true} is VALID [2022-02-21 03:02:37,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {238#true} assume !(~j <= 0); {240#(<= 1 rec2_~j)} is VALID [2022-02-21 03:02:37,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#(<= 1 rec2_~j)} assume ~j - 1 <= 2147483647; {240#(<= 1 rec2_~j)} is VALID [2022-02-21 03:02:37,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {240#(<= 1 rec2_~j)} assume !(~j - 1 >= -2147483648); {239#false} is VALID [2022-02-21 03:02:37,586 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:02:37,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:37,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175096963] [2022-02-21 03:02:37,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175096963] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:37,587 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:37,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:37,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046473162] [2022-02-21 03:02:37,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:37,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-02-21 03:02:37,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:37,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:02:37,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:37,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:37,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:37,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:37,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:37,595 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:02:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:37,657 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-02-21 03:02:37,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:37,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-02-21 03:02:37,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:02:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-21 03:02:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:02:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-21 03:02:37,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-02-21 03:02:37,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:37,707 INFO L225 Difference]: With dead ends: 42 [2022-02-21 03:02:37,707 INFO L226 Difference]: Without dead ends: 41 [2022-02-21 03:02:37,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:37,709 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:37,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 75 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-21 03:02:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-02-21 03:02:37,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:37,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 39 states, 23 states have (on average 1.434782608695652) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:37,722 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 39 states, 23 states have (on average 1.434782608695652) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:37,722 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 39 states, 23 states have (on average 1.434782608695652) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:37,725 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-21 03:02:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-02-21 03:02:37,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:37,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:37,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.434782608695652) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 41 states. [2022-02-21 03:02:37,726 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.434782608695652) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 41 states. [2022-02-21 03:02:37,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:37,729 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-21 03:02:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-02-21 03:02:37,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:37,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:37,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:37,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.434782608695652) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-02-21 03:02:37,732 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 7 [2022-02-21 03:02:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:37,733 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-02-21 03:02:37,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:02:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-02-21 03:02:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:02:37,734 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:37,734 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:37,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:02:37,734 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:37,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:37,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1026636163, now seen corresponding path program 1 times [2022-02-21 03:02:37,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:37,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529519132] [2022-02-21 03:02:37,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:37,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:37,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:02:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:37,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#true} ~j := #in~j; {422#true} is VALID [2022-02-21 03:02:37,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#true} assume ~j <= 0;#res := 0; {431#(<= |rec2_#res| 0)} is VALID [2022-02-21 03:02:37,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {431#(<= |rec2_#res| 0)} assume true; {431#(<= |rec2_#res| 0)} is VALID [2022-02-21 03:02:37,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {431#(<= |rec2_#res| 0)} {422#true} #57#return; {428#(<= |rec2_#t~ret3| 0)} is VALID [2022-02-21 03:02:37,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#true} assume { :begin_inline_ULTIMATE.init } true; {422#true} is VALID [2022-02-21 03:02:37,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {422#true} is VALID [2022-02-21 03:02:37,834 INFO L272 TraceCheckUtils]: 2: Hoare triple {422#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {422#true} is VALID [2022-02-21 03:02:37,834 INFO L290 TraceCheckUtils]: 3: Hoare triple {422#true} ~j := #in~j; {422#true} is VALID [2022-02-21 03:02:37,834 INFO L290 TraceCheckUtils]: 4: Hoare triple {422#true} assume !(~j <= 0); {422#true} is VALID [2022-02-21 03:02:37,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {422#true} assume ~j - 1 <= 2147483647; {422#true} is VALID [2022-02-21 03:02:37,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#true} assume ~j - 1 >= -2147483648; {422#true} is VALID [2022-02-21 03:02:37,835 INFO L272 TraceCheckUtils]: 7: Hoare triple {422#true} call #t~ret3 := rec2(~j - 1); {422#true} is VALID [2022-02-21 03:02:37,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#true} ~j := #in~j; {422#true} is VALID [2022-02-21 03:02:37,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#true} assume ~j <= 0;#res := 0; {431#(<= |rec2_#res| 0)} is VALID [2022-02-21 03:02:37,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {431#(<= |rec2_#res| 0)} assume true; {431#(<= |rec2_#res| 0)} is VALID [2022-02-21 03:02:37,837 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {431#(<= |rec2_#res| 0)} {422#true} #57#return; {428#(<= |rec2_#t~ret3| 0)} is VALID [2022-02-21 03:02:37,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#(<= |rec2_#t~ret3| 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {428#(<= |rec2_#t~ret3| 0)} is VALID [2022-02-21 03:02:37,838 INFO L272 TraceCheckUtils]: 13: Hoare triple {428#(<= |rec2_#t~ret3| 0)} call #t~ret4 := rec1(#t~ret3); {429#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:02:37,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#(<= |rec1_#in~i| 0)} ~i := #in~i; {430#(<= rec1_~i 0)} is VALID [2022-02-21 03:02:37,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {430#(<= rec1_~i 0)} assume !(~i <= 0); {430#(<= rec1_~i 0)} is VALID [2022-02-21 03:02:37,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {430#(<= rec1_~i 0)} assume !(~i - 2 <= 2147483647); {423#false} is VALID [2022-02-21 03:02:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:37,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:37,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529519132] [2022-02-21 03:02:37,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529519132] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:37,840 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:37,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:02:37,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355720432] [2022-02-21 03:02:37,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:37,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-21 03:02:37,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:37,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:37,853 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:02:37,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:02:37,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:37,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:02:37,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:37,854 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,027 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-02-21 03:02:38,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:02:38,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-21 03:02:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-02-21 03:02:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-02-21 03:02:38,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2022-02-21 03:02:38,110 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:02:38,111 INFO L225 Difference]: With dead ends: 85 [2022-02-21 03:02:38,112 INFO L226 Difference]: Without dead ends: 54 [2022-02-21 03:02:38,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:02:38,113 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:38,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 194 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-21 03:02:38,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2022-02-21 03:02:38,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:38,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 47 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 37 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:02:38,127 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 47 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 37 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:02:38,128 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 47 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 37 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:02:38,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,130 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-02-21 03:02:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-02-21 03:02:38,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 37 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Second operand 54 states. [2022-02-21 03:02:38,132 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 37 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Second operand 54 states. [2022-02-21 03:02:38,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,135 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-02-21 03:02:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-02-21 03:02:38,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:38,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 37 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:02:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-02-21 03:02:38,139 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 17 [2022-02-21 03:02:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:38,140 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-02-21 03:02:38,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-02-21 03:02:38,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 03:02:38,142 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:38,142 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:38,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:02:38,142 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:38,148 INFO L85 PathProgramCache]: Analyzing trace with hash -56146548, now seen corresponding path program 1 times [2022-02-21 03:02:38,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:38,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546381512] [2022-02-21 03:02:38,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:38,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:02:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#true} ~j := #in~j; {701#true} is VALID [2022-02-21 03:02:38,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#true} assume ~j <= 0;#res := 0; {701#true} is VALID [2022-02-21 03:02:38,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2022-02-21 03:02:38,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} #57#return; {701#true} is VALID [2022-02-21 03:02:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-21 03:02:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#true} ~i := #in~i; {701#true} is VALID [2022-02-21 03:02:38,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#true} assume ~i <= 0;#res := 0; {701#true} is VALID [2022-02-21 03:02:38,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2022-02-21 03:02:38,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} #59#return; {701#true} is VALID [2022-02-21 03:02:38,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#true} assume { :begin_inline_ULTIMATE.init } true; {701#true} is VALID [2022-02-21 03:02:38,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {701#true} is VALID [2022-02-21 03:02:38,203 INFO L272 TraceCheckUtils]: 2: Hoare triple {701#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {701#true} is VALID [2022-02-21 03:02:38,203 INFO L290 TraceCheckUtils]: 3: Hoare triple {701#true} ~j := #in~j; {701#true} is VALID [2022-02-21 03:02:38,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {701#true} assume !(~j <= 0); {701#true} is VALID [2022-02-21 03:02:38,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {701#true} assume ~j - 1 <= 2147483647; {701#true} is VALID [2022-02-21 03:02:38,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#true} assume ~j - 1 >= -2147483648; {701#true} is VALID [2022-02-21 03:02:38,203 INFO L272 TraceCheckUtils]: 7: Hoare triple {701#true} call #t~ret3 := rec2(~j - 1); {701#true} is VALID [2022-02-21 03:02:38,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {701#true} ~j := #in~j; {701#true} is VALID [2022-02-21 03:02:38,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {701#true} assume ~j <= 0;#res := 0; {701#true} is VALID [2022-02-21 03:02:38,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {701#true} assume true; {701#true} is VALID [2022-02-21 03:02:38,204 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {701#true} {701#true} #57#return; {701#true} is VALID [2022-02-21 03:02:38,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {701#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {701#true} is VALID [2022-02-21 03:02:38,204 INFO L272 TraceCheckUtils]: 13: Hoare triple {701#true} call #t~ret4 := rec1(#t~ret3); {701#true} is VALID [2022-02-21 03:02:38,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {701#true} ~i := #in~i; {701#true} is VALID [2022-02-21 03:02:38,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {701#true} assume ~i <= 0;#res := 0; {701#true} is VALID [2022-02-21 03:02:38,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {701#true} assume true; {701#true} is VALID [2022-02-21 03:02:38,205 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {701#true} {701#true} #59#return; {701#true} is VALID [2022-02-21 03:02:38,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {701#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {711#(<= |rec2_#t~ret4| 2147483647)} is VALID [2022-02-21 03:02:38,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {711#(<= |rec2_#t~ret4| 2147483647)} assume !(#t~ret4 - 1 <= 2147483647); {702#false} is VALID [2022-02-21 03:02:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:38,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:38,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546381512] [2022-02-21 03:02:38,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546381512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:38,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:38,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:38,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844015370] [2022-02-21 03:02:38,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:38,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-21 03:02:38,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:38,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:38,234 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:02:38,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:38,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:38,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:38,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:38,235 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,289 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-02-21 03:02:38,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:38,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-21 03:02:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-02-21 03:02:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-02-21 03:02:38,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 44 transitions. [2022-02-21 03:02:38,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:38,328 INFO L225 Difference]: With dead ends: 47 [2022-02-21 03:02:38,328 INFO L226 Difference]: Without dead ends: 46 [2022-02-21 03:02:38,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:38,330 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:38,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-21 03:02:38,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-21 03:02:38,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:38,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 36 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:02:38,342 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 36 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:02:38,342 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 36 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:02:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,344 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-02-21 03:02:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-02-21 03:02:38,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 36 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Second operand 46 states. [2022-02-21 03:02:38,345 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 36 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Second operand 46 states. [2022-02-21 03:02:38,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,352 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-02-21 03:02:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-02-21 03:02:38,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:38,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 36 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:02:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-02-21 03:02:38,358 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 20 [2022-02-21 03:02:38,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:38,359 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-02-21 03:02:38,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:38,359 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-02-21 03:02:38,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 03:02:38,359 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:38,360 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:38,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:02:38,365 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:38,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:38,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1664798682, now seen corresponding path program 1 times [2022-02-21 03:02:38,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:38,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991227476] [2022-02-21 03:02:38,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:38,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {919#true} ~j := #in~j; {919#true} is VALID [2022-02-21 03:02:38,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {919#true} assume ~j <= 0;#res := 0; {919#true} is VALID [2022-02-21 03:02:38,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {919#true} assume true; {919#true} is VALID [2022-02-21 03:02:38,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {919#true} {919#true} #57#return; {919#true} is VALID [2022-02-21 03:02:38,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:02:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {919#true} ~i := #in~i; {919#true} is VALID [2022-02-21 03:02:38,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {919#true} assume ~i <= 0;#res := 0; {930#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:38,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {930#(<= 0 |rec1_#res|)} assume true; {930#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:38,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {930#(<= 0 |rec1_#res|)} {919#true} #59#return; {929#(<= 0 |rec2_#t~ret4|)} is VALID [2022-02-21 03:02:38,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {919#true} assume { :begin_inline_ULTIMATE.init } true; {919#true} is VALID [2022-02-21 03:02:38,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {919#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {919#true} is VALID [2022-02-21 03:02:38,426 INFO L272 TraceCheckUtils]: 2: Hoare triple {919#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {919#true} is VALID [2022-02-21 03:02:38,426 INFO L290 TraceCheckUtils]: 3: Hoare triple {919#true} ~j := #in~j; {919#true} is VALID [2022-02-21 03:02:38,426 INFO L290 TraceCheckUtils]: 4: Hoare triple {919#true} assume !(~j <= 0); {919#true} is VALID [2022-02-21 03:02:38,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {919#true} assume ~j - 1 <= 2147483647; {919#true} is VALID [2022-02-21 03:02:38,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {919#true} assume ~j - 1 >= -2147483648; {919#true} is VALID [2022-02-21 03:02:38,427 INFO L272 TraceCheckUtils]: 7: Hoare triple {919#true} call #t~ret3 := rec2(~j - 1); {919#true} is VALID [2022-02-21 03:02:38,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#true} ~j := #in~j; {919#true} is VALID [2022-02-21 03:02:38,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {919#true} assume !(~j <= 0); {919#true} is VALID [2022-02-21 03:02:38,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {919#true} assume ~j - 1 <= 2147483647; {919#true} is VALID [2022-02-21 03:02:38,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {919#true} assume ~j - 1 >= -2147483648; {919#true} is VALID [2022-02-21 03:02:38,427 INFO L272 TraceCheckUtils]: 12: Hoare triple {919#true} call #t~ret3 := rec2(~j - 1); {919#true} is VALID [2022-02-21 03:02:38,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {919#true} ~j := #in~j; {919#true} is VALID [2022-02-21 03:02:38,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {919#true} assume ~j <= 0;#res := 0; {919#true} is VALID [2022-02-21 03:02:38,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {919#true} assume true; {919#true} is VALID [2022-02-21 03:02:38,428 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {919#true} {919#true} #57#return; {919#true} is VALID [2022-02-21 03:02:38,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {919#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {919#true} is VALID [2022-02-21 03:02:38,428 INFO L272 TraceCheckUtils]: 18: Hoare triple {919#true} call #t~ret4 := rec1(#t~ret3); {919#true} is VALID [2022-02-21 03:02:38,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {919#true} ~i := #in~i; {919#true} is VALID [2022-02-21 03:02:38,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {919#true} assume ~i <= 0;#res := 0; {930#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:38,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {930#(<= 0 |rec1_#res|)} assume true; {930#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:38,432 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {930#(<= 0 |rec1_#res|)} {919#true} #59#return; {929#(<= 0 |rec2_#t~ret4|)} is VALID [2022-02-21 03:02:38,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {929#(<= 0 |rec2_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {929#(<= 0 |rec2_#t~ret4|)} is VALID [2022-02-21 03:02:38,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {929#(<= 0 |rec2_#t~ret4|)} assume #t~ret4 - 1 <= 2147483647; {929#(<= 0 |rec2_#t~ret4|)} is VALID [2022-02-21 03:02:38,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {929#(<= 0 |rec2_#t~ret4|)} assume !(#t~ret4 - 1 >= -2147483648); {920#false} is VALID [2022-02-21 03:02:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:02:38,434 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:38,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991227476] [2022-02-21 03:02:38,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991227476] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:38,434 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:38,434 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:02:38,434 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197588269] [2022-02-21 03:02:38,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:38,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-21 03:02:38,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:38,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:38,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:38,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:02:38,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:38,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:02:38,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:02:38,451 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,523 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-02-21 03:02:38,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:02:38,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-21 03:02:38,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:38,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-02-21 03:02:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-02-21 03:02:38,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-02-21 03:02:38,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:38,572 INFO L225 Difference]: With dead ends: 52 [2022-02-21 03:02:38,572 INFO L226 Difference]: Without dead ends: 51 [2022-02-21 03:02:38,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:02:38,573 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:38,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-21 03:02:38,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-21 03:02:38,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:38,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.28125) internal successors, (41), 40 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:02:38,583 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.28125) internal successors, (41), 40 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:02:38,584 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.28125) internal successors, (41), 40 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:02:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,585 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-02-21 03:02:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-02-21 03:02:38,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.28125) internal successors, (41), 40 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) Second operand 51 states. [2022-02-21 03:02:38,586 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.28125) internal successors, (41), 40 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) Second operand 51 states. [2022-02-21 03:02:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,588 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-02-21 03:02:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-02-21 03:02:38,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:38,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.28125) internal successors, (41), 40 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:02:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-02-21 03:02:38,590 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 26 [2022-02-21 03:02:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:38,591 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-02-21 03:02:38,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-02-21 03:02:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-21 03:02:38,591 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:38,592 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:38,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:02:38,592 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:38,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:38,592 INFO L85 PathProgramCache]: Analyzing trace with hash 881650110, now seen corresponding path program 1 times [2022-02-21 03:02:38,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:38,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046827855] [2022-02-21 03:02:38,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:38,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:02:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {1158#true} ~j := #in~j; {1158#true} is VALID [2022-02-21 03:02:38,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#true} assume ~j <= 0;#res := 0; {1158#true} is VALID [2022-02-21 03:02:38,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-02-21 03:02:38,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1158#true} {1158#true} #57#return; {1158#true} is VALID [2022-02-21 03:02:38,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 03:02:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {1158#true} ~i := #in~i; {1158#true} is VALID [2022-02-21 03:02:38,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#true} assume ~i <= 0;#res := 0; {1193#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:38,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {1193#(<= |rec1_#res| 0)} assume true; {1193#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:38,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1193#(<= |rec1_#res| 0)} {1158#true} #59#return; {1191#(<= |rec2_#t~ret4| 0)} is VALID [2022-02-21 03:02:38,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {1158#true} ~j := #in~j; {1158#true} is VALID [2022-02-21 03:02:38,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#true} assume !(~j <= 0); {1158#true} is VALID [2022-02-21 03:02:38,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {1158#true} assume ~j - 1 <= 2147483647; {1158#true} is VALID [2022-02-21 03:02:38,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {1158#true} assume ~j - 1 >= -2147483648; {1158#true} is VALID [2022-02-21 03:02:38,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {1158#true} call #t~ret3 := rec2(~j - 1); {1158#true} is VALID [2022-02-21 03:02:38,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {1158#true} ~j := #in~j; {1158#true} is VALID [2022-02-21 03:02:38,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {1158#true} assume ~j <= 0;#res := 0; {1158#true} is VALID [2022-02-21 03:02:38,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-02-21 03:02:38,734 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1158#true} {1158#true} #57#return; {1158#true} is VALID [2022-02-21 03:02:38,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {1158#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1158#true} is VALID [2022-02-21 03:02:38,734 INFO L272 TraceCheckUtils]: 10: Hoare triple {1158#true} call #t~ret4 := rec1(#t~ret3); {1158#true} is VALID [2022-02-21 03:02:38,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {1158#true} ~i := #in~i; {1158#true} is VALID [2022-02-21 03:02:38,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {1158#true} assume ~i <= 0;#res := 0; {1193#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:38,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {1193#(<= |rec1_#res| 0)} assume true; {1193#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:38,736 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1193#(<= |rec1_#res| 0)} {1158#true} #59#return; {1191#(<= |rec2_#t~ret4| 0)} is VALID [2022-02-21 03:02:38,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {1191#(<= |rec2_#t~ret4| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1191#(<= |rec2_#t~ret4| 0)} is VALID [2022-02-21 03:02:38,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {1191#(<= |rec2_#t~ret4| 0)} assume #t~ret4 - 1 <= 2147483647; {1191#(<= |rec2_#t~ret4| 0)} is VALID [2022-02-21 03:02:38,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {1191#(<= |rec2_#t~ret4| 0)} assume #t~ret4 - 1 >= -2147483648;#res := #t~ret4 - 1;havoc #t~ret3;havoc #t~ret4; {1192#(<= (+ |rec2_#res| 1) 0)} is VALID [2022-02-21 03:02:38,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {1192#(<= (+ |rec2_#res| 1) 0)} assume true; {1192#(<= (+ |rec2_#res| 1) 0)} is VALID [2022-02-21 03:02:38,739 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1192#(<= (+ |rec2_#res| 1) 0)} {1158#true} #57#return; {1180#(<= (+ |rec2_#t~ret3| 1) 0)} is VALID [2022-02-21 03:02:38,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {1158#true} assume { :begin_inline_ULTIMATE.init } true; {1158#true} is VALID [2022-02-21 03:02:38,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1158#true} is VALID [2022-02-21 03:02:38,739 INFO L272 TraceCheckUtils]: 2: Hoare triple {1158#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {1158#true} is VALID [2022-02-21 03:02:38,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {1158#true} ~j := #in~j; {1158#true} is VALID [2022-02-21 03:02:38,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {1158#true} assume !(~j <= 0); {1158#true} is VALID [2022-02-21 03:02:38,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {1158#true} assume ~j - 1 <= 2147483647; {1158#true} is VALID [2022-02-21 03:02:38,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {1158#true} assume ~j - 1 >= -2147483648; {1158#true} is VALID [2022-02-21 03:02:38,740 INFO L272 TraceCheckUtils]: 7: Hoare triple {1158#true} call #t~ret3 := rec2(~j - 1); {1158#true} is VALID [2022-02-21 03:02:38,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {1158#true} ~j := #in~j; {1158#true} is VALID [2022-02-21 03:02:38,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {1158#true} assume !(~j <= 0); {1158#true} is VALID [2022-02-21 03:02:38,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {1158#true} assume ~j - 1 <= 2147483647; {1158#true} is VALID [2022-02-21 03:02:38,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {1158#true} assume ~j - 1 >= -2147483648; {1158#true} is VALID [2022-02-21 03:02:38,740 INFO L272 TraceCheckUtils]: 12: Hoare triple {1158#true} call #t~ret3 := rec2(~j - 1); {1158#true} is VALID [2022-02-21 03:02:38,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {1158#true} ~j := #in~j; {1158#true} is VALID [2022-02-21 03:02:38,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {1158#true} assume ~j <= 0;#res := 0; {1158#true} is VALID [2022-02-21 03:02:38,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-02-21 03:02:38,741 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1158#true} {1158#true} #57#return; {1158#true} is VALID [2022-02-21 03:02:38,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {1158#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1158#true} is VALID [2022-02-21 03:02:38,741 INFO L272 TraceCheckUtils]: 18: Hoare triple {1158#true} call #t~ret4 := rec1(#t~ret3); {1158#true} is VALID [2022-02-21 03:02:38,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {1158#true} ~i := #in~i; {1158#true} is VALID [2022-02-21 03:02:38,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {1158#true} assume ~i <= 0;#res := 0; {1193#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:38,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {1193#(<= |rec1_#res| 0)} assume true; {1193#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:38,742 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1193#(<= |rec1_#res| 0)} {1158#true} #59#return; {1191#(<= |rec2_#t~ret4| 0)} is VALID [2022-02-21 03:02:38,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {1191#(<= |rec2_#t~ret4| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1191#(<= |rec2_#t~ret4| 0)} is VALID [2022-02-21 03:02:38,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {1191#(<= |rec2_#t~ret4| 0)} assume #t~ret4 - 1 <= 2147483647; {1191#(<= |rec2_#t~ret4| 0)} is VALID [2022-02-21 03:02:38,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {1191#(<= |rec2_#t~ret4| 0)} assume #t~ret4 - 1 >= -2147483648;#res := #t~ret4 - 1;havoc #t~ret3;havoc #t~ret4; {1192#(<= (+ |rec2_#res| 1) 0)} is VALID [2022-02-21 03:02:38,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {1192#(<= (+ |rec2_#res| 1) 0)} assume true; {1192#(<= (+ |rec2_#res| 1) 0)} is VALID [2022-02-21 03:02:38,744 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1192#(<= (+ |rec2_#res| 1) 0)} {1158#true} #57#return; {1180#(<= (+ |rec2_#t~ret3| 1) 0)} is VALID [2022-02-21 03:02:38,745 INFO L290 TraceCheckUtils]: 28: Hoare triple {1180#(<= (+ |rec2_#t~ret3| 1) 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1180#(<= (+ |rec2_#t~ret3| 1) 0)} is VALID [2022-02-21 03:02:38,745 INFO L272 TraceCheckUtils]: 29: Hoare triple {1180#(<= (+ |rec2_#t~ret3| 1) 0)} call #t~ret4 := rec1(#t~ret3); {1181#(<= (+ |rec1_#in~i| 1) 0)} is VALID [2022-02-21 03:02:38,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {1181#(<= (+ |rec1_#in~i| 1) 0)} ~i := #in~i; {1182#(<= (+ rec1_~i 1) 0)} is VALID [2022-02-21 03:02:38,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {1182#(<= (+ rec1_~i 1) 0)} assume !(~i <= 0); {1182#(<= (+ rec1_~i 1) 0)} is VALID [2022-02-21 03:02:38,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {1182#(<= (+ rec1_~i 1) 0)} assume !(~i - 2 <= 2147483647); {1159#false} is VALID [2022-02-21 03:02:38,747 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:02:38,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:38,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046827855] [2022-02-21 03:02:38,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046827855] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:38,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:38,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:02:38,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110879916] [2022-02-21 03:02:38,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:38,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-02-21 03:02:38,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:38,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:38,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:38,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:02:38,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:38,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:02:38,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:02:38,766 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:38,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,957 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-02-21 03:02:38,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:02:38,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-02-21 03:02:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-02-21 03:02:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-02-21 03:02:38,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-02-21 03:02:39,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:39,017 INFO L225 Difference]: With dead ends: 65 [2022-02-21 03:02:39,017 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:02:39,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:02:39,019 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:39,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:02:39,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:02:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:02:39,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:39,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:39,027 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:39,027 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:39,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:39,027 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:02:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:02:39,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:39,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:39,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:02:39,028 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:02:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:39,028 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:02:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:02:39,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:39,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:39,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:39,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:02:39,028 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2022-02-21 03:02:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:39,028 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:02:39,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:02:39,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:39,031 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-02-21 03:02:39,031 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-02-21 03:02:39,031 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-02-21 03:02:39,032 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-02-21 03:02:39,032 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-02-21 03:02:39,032 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-02-21 03:02:39,032 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-02-21 03:02:39,032 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-02-21 03:02:39,032 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-02-21 03:02:39,032 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-02-21 03:02:39,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:02:39,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:02:39,106 INFO L858 garLoopResultBuilder]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,106 INFO L858 garLoopResultBuilder]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2022-02-21 03:02:39,106 INFO L858 garLoopResultBuilder]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,106 INFO L858 garLoopResultBuilder]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2022-02-21 03:02:39,106 INFO L858 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,106 INFO L861 garLoopResultBuilder]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2022-02-21 03:02:39,106 INFO L858 garLoopResultBuilder]: For program point L14-1(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,107 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2022-02-21 03:02:39,107 INFO L854 garLoopResultBuilder]: At program point L14-2(line 14) the Hoare annotation is: (not (<= |rec1_#in~i| 0)) [2022-02-21 03:02:39,107 INFO L858 garLoopResultBuilder]: For program point L14-3(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,107 INFO L858 garLoopResultBuilder]: For program point L14-4(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,107 INFO L858 garLoopResultBuilder]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,107 INFO L858 garLoopResultBuilder]: For program point L14-5(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,107 INFO L854 garLoopResultBuilder]: At program point L14-6(line 14) the Hoare annotation is: (not (<= |rec1_#in~i| 0)) [2022-02-21 03:02:39,107 INFO L858 garLoopResultBuilder]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,107 INFO L858 garLoopResultBuilder]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,107 INFO L858 garLoopResultBuilder]: For program point L14-7(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,109 INFO L858 garLoopResultBuilder]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,109 INFO L854 garLoopResultBuilder]: At program point L14-8(line 14) the Hoare annotation is: (not (<= |rec1_#in~i| 0)) [2022-02-21 03:02:39,109 INFO L858 garLoopResultBuilder]: For program point L14-9(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,109 INFO L858 garLoopResultBuilder]: For program point L14-10(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,109 INFO L858 garLoopResultBuilder]: For program point L14-11(line 14) no Hoare annotation was computed. [2022-02-21 03:02:39,109 INFO L858 garLoopResultBuilder]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:39,109 INFO L858 garLoopResultBuilder]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2022-02-21 03:02:39,109 INFO L858 garLoopResultBuilder]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2022-02-21 03:02:39,110 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-02-21 03:02:39,110 INFO L858 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-02-21 03:02:39,110 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 19) no Hoare annotation was computed. [2022-02-21 03:02:39,110 INFO L854 garLoopResultBuilder]: At program point L20-2(line 20) the Hoare annotation is: (or (not (<= |rec2_#in~j| 2147483647)) (and (<= 1 rec2_~j) (<= rec2_~j 2147483647))) [2022-02-21 03:02:39,110 INFO L858 garLoopResultBuilder]: For program point L20-3(line 20) no Hoare annotation was computed. [2022-02-21 03:02:39,110 INFO L854 garLoopResultBuilder]: At program point L20-4(line 20) the Hoare annotation is: (or (not (<= |rec2_#in~j| 2147483647)) (and (<= |rec2_#t~ret3| 0) (<= 1 rec2_~j) (<= rec2_~j 2147483647))) [2022-02-21 03:02:39,111 INFO L858 garLoopResultBuilder]: For program point L20-5(line 20) no Hoare annotation was computed. [2022-02-21 03:02:39,111 INFO L858 garLoopResultBuilder]: For program point L20-6(line 20) no Hoare annotation was computed. [2022-02-21 03:02:39,111 INFO L858 garLoopResultBuilder]: For program point L20-7(line 20) no Hoare annotation was computed. [2022-02-21 03:02:39,111 INFO L861 garLoopResultBuilder]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2022-02-21 03:02:39,111 INFO L858 garLoopResultBuilder]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:39,112 INFO L858 garLoopResultBuilder]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:39,112 INFO L858 garLoopResultBuilder]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:39,112 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:02:39,112 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:02:39,112 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:02:39,112 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:02:39,112 INFO L854 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (<= |ULTIMATE.start_main_~x~0#1| 2147483647) [2022-02-21 03:02:39,112 INFO L858 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-02-21 03:02:39,112 INFO L858 garLoopResultBuilder]: For program point L23(lines 23 26) no Hoare annotation was computed. [2022-02-21 03:02:39,114 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-21 03:02:39,115 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: rec1FINAL has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: rec2FINAL has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: rec1EXIT has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: rec1EXIT has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: rec1EXIT has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: rec1EXIT has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: rec2EXIT has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: rec2EXIT has no Hoare annotation [2022-02-21 03:02:39,121 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L14-7 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L14-9 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L14-4 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L14-4 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L14-9 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L14-10 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L14-10 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L14-5 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L14-5 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L14-11 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L14-11 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L20-7 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L20-7 has no Hoare annotation [2022-02-21 03:02:39,122 WARN L170 areAnnotationChecker]: L14-7 has no Hoare annotation [2022-02-21 03:02:39,122 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:02:39,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:02:39 BoogieIcfgContainer [2022-02-21 03:02:39,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:02:39,124 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:02:39,124 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:02:39,124 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:02:39,125 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:36" (3/4) ... [2022-02-21 03:02:39,126 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:02:39,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2022-02-21 03:02:39,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2022-02-21 03:02:39,134 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-21 03:02:39,135 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:02:39,135 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:02:39,159 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:02:39,160 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:02:39,161 INFO L158 Benchmark]: Toolchain (without parser) took 2872.54ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 63.0MB in the beginning and 42.2MB in the end (delta: 20.8MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2022-02-21 03:02:39,162 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 69.2MB. Free memory is still 32.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:02:39,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.85ms. Allocated memory is still 94.4MB. Free memory was 63.0MB in the beginning and 70.9MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:02:39,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.01ms. Allocated memory is still 94.4MB. Free memory was 70.9MB in the beginning and 69.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:02:39,162 INFO L158 Benchmark]: Boogie Preprocessor took 17.64ms. Allocated memory is still 94.4MB. Free memory was 69.6MB in the beginning and 68.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:02:39,162 INFO L158 Benchmark]: RCFGBuilder took 298.48ms. Allocated memory is still 94.4MB. Free memory was 68.5MB in the beginning and 56.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:02:39,163 INFO L158 Benchmark]: TraceAbstraction took 2264.40ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 55.9MB in the beginning and 44.3MB in the end (delta: 11.6MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2022-02-21 03:02:39,163 INFO L158 Benchmark]: Witness Printer took 35.64ms. Allocated memory is still 119.5MB. Free memory was 44.3MB in the beginning and 42.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:02:39,165 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.32ms. Allocated memory is still 69.2MB. Free memory is still 32.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.85ms. Allocated memory is still 94.4MB. Free memory was 63.0MB in the beginning and 70.9MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.01ms. Allocated memory is still 94.4MB. Free memory was 70.9MB in the beginning and 69.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.64ms. Allocated memory is still 94.4MB. Free memory was 69.6MB in the beginning and 68.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 298.48ms. Allocated memory is still 94.4MB. Free memory was 68.5MB in the beginning and 56.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2264.40ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 55.9MB in the beginning and 44.3MB in the end (delta: 11.6MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * Witness Printer took 35.64ms. Allocated memory is still 119.5MB. Free memory was 44.3MB in the beginning and 42.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 45 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 737 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 510 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 227 mSDtfsCounter, 125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 47 PreInvPairs, 51 NumberOfFragments, 44 HoareAnnotationTreeSize, 47 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 42 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 28/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-21 03:02:39,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE