./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.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 9c9c032ca120503dfa93615a57a0bb47775014248f579f3a3fd38a4985b2298b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:58:31,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:58:31,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:58:31,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:58:31,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:58:31,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:58:31,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:58:31,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:58:31,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:58:31,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:58:31,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:58:31,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:58:31,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:58:31,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:58:31,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:58:31,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:58:31,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:58:31,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:58:31,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:58:31,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:58:31,423 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:58:31,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:58:31,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:58:31,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:58:31,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:58:31,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:58:31,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:58:31,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:58:31,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:58:31,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:58:31,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:58:31,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:58:31,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:58:31,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:58:31,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:58:31,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:58:31,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:58:31,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:58:31,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:58:31,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:58:31,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:58:31,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:58:31,438 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-07-13 01:58:31,457 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:58:31,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:58:31,458 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:58:31,458 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:58:31,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:58:31,458 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:58:31,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:58:31,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:58:31,459 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:58:31,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:58:31,460 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:58:31,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:58:31,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:58:31,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 01:58:31,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:58:31,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 01:58:31,461 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-13 01:58:31,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 01:58:31,461 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:58:31,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 01:58:31,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:58:31,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:58:31,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:58:31,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:58:31,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:58:31,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:58:31,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 01:58:31,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 01:58:31,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 01:58:31,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 01:58:31,463 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 -> 9c9c032ca120503dfa93615a57a0bb47775014248f579f3a3fd38a4985b2298b [2022-07-13 01:58:31,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:58:31,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:58:31,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:58:31,616 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:58:31,617 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:58:31,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2022-07-13 01:58:31,665 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e909024f7/bac35b05013143a688b245c066d5f45b/FLAGc8595045b [2022-07-13 01:58:31,951 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:58:31,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2022-07-13 01:58:31,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e909024f7/bac35b05013143a688b245c066d5f45b/FLAGc8595045b [2022-07-13 01:58:32,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e909024f7/bac35b05013143a688b245c066d5f45b [2022-07-13 01:58:32,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:58:32,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:58:32,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:58:32,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:58:32,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:58:32,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:58:32" (1/1) ... [2022-07-13 01:58:32,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115e67da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:32, skipping insertion in model container [2022-07-13 01:58:32,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:58:32" (1/1) ... [2022-07-13 01:58:32,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:58:32,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:58:32,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:58:32,535 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 01:58:32,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:58:32,561 INFO L208 MainTranslator]: Completed translation [2022-07-13 01:58:32,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:32 WrapperNode [2022-07-13 01:58:32,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:58:32,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 01:58:32,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 01:58:32,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 01:58:32,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:32" (1/1) ... [2022-07-13 01:58:32,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:32" (1/1) ... [2022-07-13 01:58:32,584 INFO L137 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 8 [2022-07-13 01:58:32,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 01:58:32,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 01:58:32,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 01:58:32,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 01:58:32,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:32" (1/1) ... [2022-07-13 01:58:32,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:32" (1/1) ... [2022-07-13 01:58:32,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:32" (1/1) ... [2022-07-13 01:58:32,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:32" (1/1) ... [2022-07-13 01:58:32,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:32" (1/1) ... [2022-07-13 01:58:32,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:32" (1/1) ... [2022-07-13 01:58:32,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:32" (1/1) ... [2022-07-13 01:58:32,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 01:58:32,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 01:58:32,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 01:58:32,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 01:58:32,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:32" (1/1) ... [2022-07-13 01:58:32,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:58:32,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:58:32,629 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-07-13 01:58:32,631 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-07-13 01:58:32,662 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2022-07-13 01:58:32,663 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2022-07-13 01:58:32,663 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2022-07-13 01:58:32,663 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2022-07-13 01:58:32,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 01:58:32,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 01:58:32,703 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 01:58:32,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 01:58:32,794 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 01:58:32,799 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 01:58:32,799 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 01:58:32,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:58:32 BoogieIcfgContainer [2022-07-13 01:58:32,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 01:58:32,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 01:58:32,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 01:58:32,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 01:58:32,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 01:58:32" (1/3) ... [2022-07-13 01:58:32,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a185637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:58:32, skipping insertion in model container [2022-07-13 01:58:32,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:32" (2/3) ... [2022-07-13 01:58:32,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a185637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:58:32, skipping insertion in model container [2022-07-13 01:58:32,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:58:32" (3/3) ... [2022-07-13 01:58:32,807 INFO L111 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d.c [2022-07-13 01:58:32,816 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 01:58:32,817 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-07-13 01:58:32,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 01:58:32,853 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39405fa9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7646a6a9 [2022-07-13 01:58:32,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-07-13 01:58:32,857 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-07-13 01:58:32,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 01:58:32,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:32,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:32,863 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:32,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1295673562, now seen corresponding path program 1 times [2022-07-13 01:58:32,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:32,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21177810] [2022-07-13 01:58:32,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:32,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:58:33,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:33,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21177810] [2022-07-13 01:58:33,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21177810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:33,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:33,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 01:58:33,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360141298] [2022-07-13 01:58:33,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:33,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 01:58:33,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:33,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 01:58:33,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:58:33,067 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 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:58:33,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:33,182 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-07-13 01:58:33,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 01:58:33,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-13 01:58:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:33,190 INFO L225 Difference]: With dead ends: 87 [2022-07-13 01:58:33,191 INFO L226 Difference]: Without dead ends: 80 [2022-07-13 01:58:33,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:58:33,196 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 65 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:33,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 218 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:58:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-13 01:58:33,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2022-07-13 01:58:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 52 states have internal predecessors, (64), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 01:58:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-07-13 01:58:33,230 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 9 [2022-07-13 01:58:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:33,231 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-07-13 01:58:33,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:58:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-07-13 01:58:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 01:58:33,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:33,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:33,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 01:58:33,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:33,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:33,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1511174720, now seen corresponding path program 1 times [2022-07-13 01:58:33,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:33,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953322293] [2022-07-13 01:58:33,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:33,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:58:33,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:33,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953322293] [2022-07-13 01:58:33,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953322293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:33,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:33,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:58:33,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376059877] [2022-07-13 01:58:33,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:33,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:58:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:33,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:58:33,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:58:33,253 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:58:33,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:33,275 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2022-07-13 01:58:33,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:58:33,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-13 01:58:33,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:33,277 INFO L225 Difference]: With dead ends: 71 [2022-07-13 01:58:33,277 INFO L226 Difference]: Without dead ends: 70 [2022-07-13 01:58:33,277 INFO L412 NwaCegarLoop]: 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-07-13 01:58:33,278 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:33,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 71 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-13 01:58:33,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2022-07-13 01:58:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.441860465116279) internal successors, (62), 51 states have internal predecessors, (62), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 01:58:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2022-07-13 01:58:33,290 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 10 [2022-07-13 01:58:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:33,291 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2022-07-13 01:58:33,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:58:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2022-07-13 01:58:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 01:58:33,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:33,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:33,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 01:58:33,292 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:33,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:33,293 INFO L85 PathProgramCache]: Analyzing trace with hash -540327935, now seen corresponding path program 1 times [2022-07-13 01:58:33,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:33,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846369790] [2022-07-13 01:58:33,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:33,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 01:58:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:58:33,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:33,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846369790] [2022-07-13 01:58:33,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846369790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:33,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:33,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:58:33,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576345976] [2022-07-13 01:58:33,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:33,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:58:33,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:33,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:58:33,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:58:33,316 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:58:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:33,326 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2022-07-13 01:58:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:58:33,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-07-13 01:58:33,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:33,328 INFO L225 Difference]: With dead ends: 66 [2022-07-13 01:58:33,328 INFO L226 Difference]: Without dead ends: 65 [2022-07-13 01:58:33,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:58:33,330 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:33,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 74 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:33,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-13 01:58:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-13 01:58:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 01:58:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2022-07-13 01:58:33,338 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 12 [2022-07-13 01:58:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:33,339 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2022-07-13 01:58:33,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:58:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2022-07-13 01:58:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 01:58:33,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:33,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:33,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 01:58:33,340 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:33,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:33,341 INFO L85 PathProgramCache]: Analyzing trace with hash 429703263, now seen corresponding path program 1 times [2022-07-13 01:58:33,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:33,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725739633] [2022-07-13 01:58:33,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:33,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 01:58:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:58:33,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:33,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725739633] [2022-07-13 01:58:33,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725739633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:33,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:33,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:58:33,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797402846] [2022-07-13 01:58:33,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:33,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:58:33,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:33,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:58:33,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:58:33,372 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:58:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:33,393 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2022-07-13 01:58:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:58:33,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-13 01:58:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:33,395 INFO L225 Difference]: With dead ends: 86 [2022-07-13 01:58:33,395 INFO L226 Difference]: Without dead ends: 85 [2022-07-13 01:58:33,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-07-13 01:58:33,396 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:33,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 115 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-13 01:58:33,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2022-07-13 01:58:33,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 58 states have internal predecessors, (68), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2022-07-13 01:58:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2022-07-13 01:58:33,411 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 13 [2022-07-13 01:58:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:33,412 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2022-07-13 01:58:33,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:58:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2022-07-13 01:58:33,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 01:58:33,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:33,413 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:33,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 01:58:33,413 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:33,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:33,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1511918191, now seen corresponding path program 1 times [2022-07-13 01:58:33,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:33,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389308661] [2022-07-13 01:58:33,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:33,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 01:58:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 01:58:33,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:33,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389308661] [2022-07-13 01:58:33,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389308661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:33,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:33,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:58:33,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456805397] [2022-07-13 01:58:33,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:33,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:58:33,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:33,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:58:33,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:58:33,438 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:58:33,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:33,447 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2022-07-13 01:58:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:58:33,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 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-07-13 01:58:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:33,449 INFO L225 Difference]: With dead ends: 75 [2022-07-13 01:58:33,449 INFO L226 Difference]: Without dead ends: 74 [2022-07-13 01:58:33,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:58:33,450 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:33,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 70 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:33,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-13 01:58:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-13 01:58:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2022-07-13 01:58:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2022-07-13 01:58:33,458 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 17 [2022-07-13 01:58:33,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:33,458 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2022-07-13 01:58:33,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:58:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2022-07-13 01:58:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 01:58:33,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:33,459 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:33,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 01:58:33,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:33,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:33,460 INFO L85 PathProgramCache]: Analyzing trace with hash 375176379, now seen corresponding path program 1 times [2022-07-13 01:58:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:33,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097709655] [2022-07-13 01:58:33,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:33,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 01:58:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 01:58:33,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:33,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097709655] [2022-07-13 01:58:33,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097709655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:33,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:33,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:58:33,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378707789] [2022-07-13 01:58:33,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:33,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:58:33,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:33,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:58:33,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:58:33,490 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:58:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:33,514 INFO L93 Difference]: Finished difference Result 95 states and 127 transitions. [2022-07-13 01:58:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:58:33,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 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 18 [2022-07-13 01:58:33,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:33,518 INFO L225 Difference]: With dead ends: 95 [2022-07-13 01:58:33,518 INFO L226 Difference]: Without dead ends: 94 [2022-07-13 01:58:33,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-07-13 01:58:33,520 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:33,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 112 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-13 01:58:33,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2022-07-13 01:58:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2022-07-13 01:58:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2022-07-13 01:58:33,542 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 18 [2022-07-13 01:58:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:33,542 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2022-07-13 01:58:33,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:58:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2022-07-13 01:58:33,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 01:58:33,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:33,544 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:33,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 01:58:33,544 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:33,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:33,544 INFO L85 PathProgramCache]: Analyzing trace with hash 465426087, now seen corresponding path program 1 times [2022-07-13 01:58:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:33,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596102251] [2022-07-13 01:58:33,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:33,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 01:58:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:58:33,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:33,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596102251] [2022-07-13 01:58:33,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596102251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:33,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:33,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 01:58:33,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164007050] [2022-07-13 01:58:33,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:33,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:58:33,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:58:33,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:58:33,590 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:58:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:33,631 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2022-07-13 01:58:33,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:58:33,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-13 01:58:33,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:33,633 INFO L225 Difference]: With dead ends: 126 [2022-07-13 01:58:33,633 INFO L226 Difference]: Without dead ends: 76 [2022-07-13 01:58:33,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-07-13 01:58:33,637 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 27 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:33,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 104 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-13 01:58:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-07-13 01:58:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2022-07-13 01:58:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2022-07-13 01:58:33,651 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 20 [2022-07-13 01:58:33,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:33,652 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2022-07-13 01:58:33,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:58:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2022-07-13 01:58:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 01:58:33,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:33,653 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:33,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 01:58:33,653 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:33,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:33,654 INFO L85 PathProgramCache]: Analyzing trace with hash -334519671, now seen corresponding path program 1 times [2022-07-13 01:58:33,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:33,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161388037] [2022-07-13 01:58:33,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:33,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 01:58:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 01:58:33,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:33,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161388037] [2022-07-13 01:58:33,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161388037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:33,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:33,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 01:58:33,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400588313] [2022-07-13 01:58:33,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:33,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 01:58:33,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:33,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 01:58:33,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:58:33,694 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:58:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:33,741 INFO L93 Difference]: Finished difference Result 150 states and 207 transitions. [2022-07-13 01:58:33,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:58:33,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-07-13 01:58:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:33,742 INFO L225 Difference]: With dead ends: 150 [2022-07-13 01:58:33,743 INFO L226 Difference]: Without dead ends: 92 [2022-07-13 01:58:33,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:58:33,744 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:33,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 183 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-13 01:58:33,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-07-13 01:58:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 62 states have internal predecessors, (69), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2022-07-13 01:58:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2022-07-13 01:58:33,752 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 22 [2022-07-13 01:58:33,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:33,752 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2022-07-13 01:58:33,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:58:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2022-07-13 01:58:33,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 01:58:33,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:33,753 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:33,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 01:58:33,754 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:33,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:33,754 INFO L85 PathProgramCache]: Analyzing trace with hash 289256194, now seen corresponding path program 1 times [2022-07-13 01:58:33,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:33,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002588041] [2022-07-13 01:58:33,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:33,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 01:58:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 01:58:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 01:58:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:33,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002588041] [2022-07-13 01:58:33,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002588041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:33,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:33,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 01:58:33,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794193826] [2022-07-13 01:58:33,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:33,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 01:58:33,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:33,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 01:58:33,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:58:33,797 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:58:33,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:33,861 INFO L93 Difference]: Finished difference Result 159 states and 211 transitions. [2022-07-13 01:58:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:58:33,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-07-13 01:58:33,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:33,863 INFO L225 Difference]: With dead ends: 159 [2022-07-13 01:58:33,863 INFO L226 Difference]: Without dead ends: 96 [2022-07-13 01:58:33,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:58:33,864 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:33,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 187 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-13 01:58:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2022-07-13 01:58:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 67 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-13 01:58:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-07-13 01:58:33,872 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 28 [2022-07-13 01:58:33,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:33,872 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-07-13 01:58:33,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:58:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-07-13 01:58:33,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 01:58:33,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:33,873 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:33,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 01:58:33,874 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:33,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:33,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1526545827, now seen corresponding path program 1 times [2022-07-13 01:58:33,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:33,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048665414] [2022-07-13 01:58:33,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:33,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 01:58:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 01:58:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 01:58:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 01:58:33,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:33,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048665414] [2022-07-13 01:58:33,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048665414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:33,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:33,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:58:33,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86470550] [2022-07-13 01:58:33,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:33,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:58:33,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:33,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:58:33,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:58:33,905 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 01:58:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:33,920 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2022-07-13 01:58:33,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:58:33,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-07-13 01:58:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:33,922 INFO L225 Difference]: With dead ends: 95 [2022-07-13 01:58:33,922 INFO L226 Difference]: Without dead ends: 94 [2022-07-13 01:58:33,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-07-13 01:58:33,923 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:33,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 112 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:33,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-13 01:58:33,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-07-13 01:58:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 69 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-13 01:58:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2022-07-13 01:58:33,930 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 31 [2022-07-13 01:58:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:33,930 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2022-07-13 01:58:33,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 01:58:33,930 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2022-07-13 01:58:33,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 01:58:33,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:33,931 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:33,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 01:58:33,932 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:33,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:33,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1525554823, now seen corresponding path program 1 times [2022-07-13 01:58:33,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:33,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505935368] [2022-07-13 01:58:33,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:33,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 01:58:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 01:58:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 01:58:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 01:58:33,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:33,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505935368] [2022-07-13 01:58:33,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505935368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:33,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:33,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:58:33,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003325140] [2022-07-13 01:58:33,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:33,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:58:33,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:33,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:58:33,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:58:33,957 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 01:58:33,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:33,963 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2022-07-13 01:58:33,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:58:33,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-07-13 01:58:33,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:33,967 INFO L225 Difference]: With dead ends: 92 [2022-07-13 01:58:33,967 INFO L226 Difference]: Without dead ends: 91 [2022-07-13 01:58:33,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-07-13 01:58:33,968 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 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-07-13 01:58:33,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-13 01:58:33,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-13 01:58:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 68 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-13 01:58:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-07-13 01:58:33,980 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 37 [2022-07-13 01:58:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:33,980 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-07-13 01:58:33,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 01:58:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-07-13 01:58:33,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 01:58:33,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:33,986 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:33,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 01:58:33,986 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:33,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1908591901, now seen corresponding path program 1 times [2022-07-13 01:58:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:33,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199154489] [2022-07-13 01:58:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 01:58:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 01:58:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 01:58:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 01:58:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 01:58:34,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:34,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199154489] [2022-07-13 01:58:34,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199154489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:34,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:34,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 01:58:34,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534752894] [2022-07-13 01:58:34,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:34,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 01:58:34,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:34,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 01:58:34,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:58:34,039 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 01:58:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:34,077 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2022-07-13 01:58:34,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:58:34,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-07-13 01:58:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:34,078 INFO L225 Difference]: With dead ends: 101 [2022-07-13 01:58:34,079 INFO L226 Difference]: Without dead ends: 100 [2022-07-13 01:58:34,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:58:34,079 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:34,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 156 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-13 01:58:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2022-07-13 01:58:34,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 67 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-13 01:58:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2022-07-13 01:58:34,089 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 47 [2022-07-13 01:58:34,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:34,090 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2022-07-13 01:58:34,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 01:58:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-07-13 01:58:34,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 01:58:34,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:34,093 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:34,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 01:58:34,093 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:34,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:34,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1338149547, now seen corresponding path program 1 times [2022-07-13 01:58:34,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:34,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017431348] [2022-07-13 01:58:34,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:34,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 01:58:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 01:58:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 01:58:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 01:58:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 01:58:34,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:34,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017431348] [2022-07-13 01:58:34,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017431348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:34,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:34,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 01:58:34,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235965296] [2022-07-13 01:58:34,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:34,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 01:58:34,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:34,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 01:58:34,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:58:34,147 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 01:58:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:34,180 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2022-07-13 01:58:34,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 01:58:34,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-07-13 01:58:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:34,183 INFO L225 Difference]: With dead ends: 90 [2022-07-13 01:58:34,183 INFO L226 Difference]: Without dead ends: 89 [2022-07-13 01:58:34,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:58:34,184 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:34,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 153 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-13 01:58:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-13 01:58:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-13 01:58:34,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2022-07-13 01:58:34,208 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 37 [2022-07-13 01:58:34,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:34,208 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2022-07-13 01:58:34,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 01:58:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2022-07-13 01:58:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 01:58:34,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:34,214 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:34,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 01:58:34,215 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:34,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:34,215 INFO L85 PathProgramCache]: Analyzing trace with hash 189968875, now seen corresponding path program 1 times [2022-07-13 01:58:34,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:34,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090260273] [2022-07-13 01:58:34,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:34,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 01:58:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 01:58:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 01:58:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 01:58:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 01:58:34,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:34,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090260273] [2022-07-13 01:58:34,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090260273] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:58:34,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816132545] [2022-07-13 01:58:34,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:34,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 01:58:34,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:58:34,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 01:58:34,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 01:58:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:34,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:58:34,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:58:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 01:58:34,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:58:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 01:58:34,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816132545] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:58:34,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 01:58:34,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-13 01:58:34,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649560445] [2022-07-13 01:58:34,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 01:58:34,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 01:58:34,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:34,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 01:58:34,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-13 01:58:34,595 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 01:58:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:34,778 INFO L93 Difference]: Finished difference Result 200 states and 246 transitions. [2022-07-13 01:58:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 01:58:34,779 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2022-07-13 01:58:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:34,780 INFO L225 Difference]: With dead ends: 200 [2022-07-13 01:58:34,780 INFO L226 Difference]: Without dead ends: 124 [2022-07-13 01:58:34,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2022-07-13 01:58:34,781 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 29 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:34,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 256 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:58:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-13 01:58:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 100. [2022-07-13 01:58:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.095890410958904) internal successors, (80), 75 states have internal predecessors, (80), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-13 01:58:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-07-13 01:58:34,786 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 51 [2022-07-13 01:58:34,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:34,786 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-07-13 01:58:34,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 01:58:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-07-13 01:58:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 01:58:34,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:34,787 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:34,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 01:58:34,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 01:58:35,000 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:35,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:35,000 INFO L85 PathProgramCache]: Analyzing trace with hash 641343195, now seen corresponding path program 1 times [2022-07-13 01:58:35,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:35,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614580314] [2022-07-13 01:58:35,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:35,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 01:58:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 01:58:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 01:58:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 01:58:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 01:58:35,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:35,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614580314] [2022-07-13 01:58:35,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614580314] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:58:35,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046183479] [2022-07-13 01:58:35,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:35,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 01:58:35,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:58:35,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 01:58:35,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 01:58:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:58:35,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:58:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 01:58:35,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:58:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 01:58:35,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046183479] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:58:35,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 01:58:35,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2022-07-13 01:58:35,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940278355] [2022-07-13 01:58:35,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 01:58:35,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:58:35,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:35,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:58:35,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:58:35,166 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 01:58:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:35,199 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2022-07-13 01:58:35,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 01:58:35,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-13 01:58:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:35,200 INFO L225 Difference]: With dead ends: 119 [2022-07-13 01:58:35,200 INFO L226 Difference]: Without dead ends: 61 [2022-07-13 01:58:35,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:58:35,201 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:35,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 151 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-13 01:58:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-07-13 01:58:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-13 01:58:35,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2022-07-13 01:58:35,204 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 44 [2022-07-13 01:58:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:35,205 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2022-07-13 01:58:35,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 01:58:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-07-13 01:58:35,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 01:58:35,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:35,205 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:35,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 01:58:35,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 01:58:35,422 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:35,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:35,422 INFO L85 PathProgramCache]: Analyzing trace with hash 640030532, now seen corresponding path program 1 times [2022-07-13 01:58:35,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:35,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051489885] [2022-07-13 01:58:35,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:35,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 01:58:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 01:58:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 01:58:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 01:58:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 01:58:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 01:58:35,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:35,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051489885] [2022-07-13 01:58:35,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051489885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:35,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:35,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:58:35,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588110228] [2022-07-13 01:58:35,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:35,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:58:35,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:35,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:58:35,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:58:35,452 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-13 01:58:35,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:35,455 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-07-13 01:58:35,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:58:35,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2022-07-13 01:58:35,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:35,456 INFO L225 Difference]: With dead ends: 59 [2022-07-13 01:58:35,457 INFO L226 Difference]: Without dead ends: 58 [2022-07-13 01:58:35,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-07-13 01:58:35,457 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:35,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-13 01:58:35,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-07-13 01:58:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-13 01:58:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-07-13 01:58:35,461 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2022-07-13 01:58:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:35,462 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-07-13 01:58:35,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-13 01:58:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-07-13 01:58:35,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 01:58:35,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:35,462 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:35,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 01:58:35,463 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-13 01:58:35,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:35,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1633889918, now seen corresponding path program 1 times [2022-07-13 01:58:35,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:35,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307963308] [2022-07-13 01:58:35,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:35,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 01:58:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 01:58:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 01:58:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 01:58:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 01:58:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 01:58:35,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:35,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307963308] [2022-07-13 01:58:35,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307963308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:35,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:35,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:58:35,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482344544] [2022-07-13 01:58:35,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:35,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:58:35,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:35,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:58:35,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:58:35,492 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-13 01:58:35,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:35,497 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-07-13 01:58:35,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:58:35,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2022-07-13 01:58:35,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:35,498 INFO L225 Difference]: With dead ends: 58 [2022-07-13 01:58:35,498 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 01:58:35,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-07-13 01:58:35,499 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:35,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:58:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 01:58:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 01:58:35,500 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-07-13 01:58:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 01:58:35,500 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-07-13 01:58:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:35,500 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 01:58:35,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-13 01:58:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 01:58:35,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 01:58:35,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-07-13 01:58:35,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-07-13 01:58:35,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-07-13 01:58:35,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-07-13 01:58:35,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-07-13 01:58:35,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-07-13 01:58:35,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-07-13 01:58:35,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-07-13 01:58:35,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-07-13 01:58:35,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-07-13 01:58:35,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 01:58:35,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 01:58:35,667 INFO L899 garLoopResultBuilder]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,667 INFO L899 garLoopResultBuilder]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2022-07-13 01:58:35,667 INFO L899 garLoopResultBuilder]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,667 INFO L899 garLoopResultBuilder]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2022-07-13 01:58:35,667 INFO L899 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,668 INFO L902 garLoopResultBuilder]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2022-07-13 01:58:35,668 INFO L899 garLoopResultBuilder]: For program point L14-1(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,668 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2022-07-13 01:58:35,668 INFO L895 garLoopResultBuilder]: At program point L14-2(line 14) the Hoare annotation is: (or (not (<= |rec1_#in~i| 2147483647)) (and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))) [2022-07-13 01:58:35,668 INFO L899 garLoopResultBuilder]: For program point L14-3(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,668 INFO L899 garLoopResultBuilder]: For program point L14-4(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,669 INFO L899 garLoopResultBuilder]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,669 INFO L899 garLoopResultBuilder]: For program point L14-5(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,669 INFO L895 garLoopResultBuilder]: At program point L14-6(line 14) the Hoare annotation is: (or (and (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) (not (<= |rec1_#in~i| 2147483647))) [2022-07-13 01:58:35,669 INFO L899 garLoopResultBuilder]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,669 INFO L899 garLoopResultBuilder]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,669 INFO L899 garLoopResultBuilder]: For program point L14-7(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,669 INFO L899 garLoopResultBuilder]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,670 INFO L895 garLoopResultBuilder]: At program point L14-8(line 14) the Hoare annotation is: (and (not (<= |rec1_#in~i| 0)) (or (and (<= |rec1_#t~ret1| 0) (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) (not (<= |rec1_#in~i| 2147483647)))) [2022-07-13 01:58:35,670 INFO L899 garLoopResultBuilder]: For program point L14-9(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,670 INFO L899 garLoopResultBuilder]: For program point L14-10(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,670 INFO L899 garLoopResultBuilder]: For program point L14-11(line 14) no Hoare annotation was computed. [2022-07-13 01:58:35,670 INFO L899 garLoopResultBuilder]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-07-13 01:58:35,670 INFO L899 garLoopResultBuilder]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2022-07-13 01:58:35,670 INFO L899 garLoopResultBuilder]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2022-07-13 01:58:35,670 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (and (not (<= |rec2_#in~j| 0)) (or (not (<= |rec2_#in~j| 2147483647)) (and (<= 1 rec2_~j) (<= rec2_~j 2147483647)))) [2022-07-13 01:58:35,671 INFO L899 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-07-13 01:58:35,671 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 19) no Hoare annotation was computed. [2022-07-13 01:58:35,671 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2022-07-13 01:58:35,671 INFO L899 garLoopResultBuilder]: For program point L20-3(line 20) no Hoare annotation was computed. [2022-07-13 01:58:35,671 INFO L895 garLoopResultBuilder]: At program point L20-4(line 20) the Hoare annotation is: (and (or (not (<= |rec2_#in~j| 2147483647)) (and (<= |rec2_#t~ret3| 1) (<= 1 |rec2_#t~ret3|) (<= 1 rec2_~j) (<= rec2_~j 2147483647))) (not (<= |rec2_#in~j| 0))) [2022-07-13 01:58:35,671 INFO L899 garLoopResultBuilder]: For program point L20-5(line 20) no Hoare annotation was computed. [2022-07-13 01:58:35,671 INFO L899 garLoopResultBuilder]: For program point L20-6(line 20) no Hoare annotation was computed. [2022-07-13 01:58:35,671 INFO L899 garLoopResultBuilder]: For program point L20-7(line 20) no Hoare annotation was computed. [2022-07-13 01:58:35,672 INFO L902 garLoopResultBuilder]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2022-07-13 01:58:35,672 INFO L899 garLoopResultBuilder]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-07-13 01:58:35,672 INFO L899 garLoopResultBuilder]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-07-13 01:58:35,672 INFO L899 garLoopResultBuilder]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-07-13 01:58:35,672 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 01:58:35,672 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 01:58:35,672 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 01:58:35,672 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 01:58:35,673 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (<= |ULTIMATE.start_main_~x~0#1| 2147483647) [2022-07-13 01:58:35,673 INFO L899 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-07-13 01:58:35,673 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 26) no Hoare annotation was computed. [2022-07-13 01:58:35,675 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:35,677 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 01:58:35,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 01:58:35 BoogieIcfgContainer [2022-07-13 01:58:35,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 01:58:35,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 01:58:35,680 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 01:58:35,680 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 01:58:35,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:58:32" (3/4) ... [2022-07-13 01:58:35,682 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 01:58:35,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2022-07-13 01:58:35,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2022-07-13 01:58:35,689 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-13 01:58:35,689 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-13 01:58:35,689 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 01:58:35,709 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 01:58:35,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 01:58:35,710 INFO L158 Benchmark]: Toolchain (without parser) took 3318.93ms. Allocated memory was 140.5MB in the beginning and 184.5MB in the end (delta: 44.0MB). Free memory was 108.4MB in the beginning and 123.5MB in the end (delta: -15.1MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2022-07-13 01:58:35,710 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 81.8MB. Free memory was 41.5MB in the beginning and 41.5MB in the end (delta: 39.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 01:58:35,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.55ms. Allocated memory is still 140.5MB. Free memory was 108.1MB in the beginning and 117.5MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 01:58:35,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.14ms. Allocated memory is still 140.5MB. Free memory was 117.5MB in the beginning and 116.7MB in the end (delta: 826.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 01:58:35,710 INFO L158 Benchmark]: Boogie Preprocessor took 11.85ms. Allocated memory is still 140.5MB. Free memory was 116.7MB in the beginning and 115.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 01:58:35,711 INFO L158 Benchmark]: RCFGBuilder took 203.25ms. Allocated memory is still 140.5MB. Free memory was 115.5MB in the beginning and 105.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 01:58:35,711 INFO L158 Benchmark]: TraceAbstraction took 2877.33ms. Allocated memory was 140.5MB in the beginning and 184.5MB in the end (delta: 44.0MB). Free memory was 104.1MB in the beginning and 126.7MB in the end (delta: -22.5MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-07-13 01:58:35,711 INFO L158 Benchmark]: Witness Printer took 29.77ms. Allocated memory is still 184.5MB. Free memory was 126.7MB in the beginning and 123.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 01:58:35,712 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 81.8MB. Free memory was 41.5MB in the beginning and 41.5MB in the end (delta: 39.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.55ms. Allocated memory is still 140.5MB. Free memory was 108.1MB in the beginning and 117.5MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.14ms. Allocated memory is still 140.5MB. Free memory was 117.5MB in the beginning and 116.7MB in the end (delta: 826.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.85ms. Allocated memory is still 140.5MB. Free memory was 116.7MB in the beginning and 115.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 203.25ms. Allocated memory is still 140.5MB. Free memory was 115.5MB in the beginning and 105.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2877.33ms. Allocated memory was 140.5MB in the beginning and 184.5MB in the end (delta: 44.0MB). Free memory was 104.1MB in the beginning and 126.7MB in the end (delta: -22.5MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Witness Printer took 29.77ms. Allocated memory is still 184.5MB. Free memory was 126.7MB in the beginning and 123.5MB in the end (delta: 3.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.8s, OverallIterations: 17, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 235 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 2201 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1534 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 669 IncrementalHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 667 mSDtfsCounter, 669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=14, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 101 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 194 PreInvPairs, 201 NumberOfFragments, 92 HoareAnnotationTreeSize, 194 FomulaSimplifications, 52 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 613 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 654 ConstructedInterpolants, 0 QuantifiedInterpolants, 972 SizeOfPredicates, 2 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 514/526 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-07-13 01:58:35,755 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