./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 35987657 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_1b.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 9948dbd77aeb2de72e0bd3a3a4e22b1606b19383e4631af58adbec46ed909b6c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 00:29:38,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 00:29:38,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 00:29:38,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 00:29:38,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 00:29:38,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 00:29:38,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 00:29:38,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 00:29:38,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 00:29:38,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 00:29:38,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 00:29:38,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 00:29:38,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 00:29:38,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 00:29:38,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 00:29:38,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 00:29:38,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 00:29:38,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 00:29:38,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 00:29:38,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 00:29:38,497 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 00:29:38,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 00:29:38,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 00:29:38,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 00:29:38,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 00:29:38,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 00:29:38,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 00:29:38,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 00:29:38,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 00:29:38,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 00:29:38,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 00:29:38,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 00:29:38,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 00:29:38,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 00:29:38,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 00:29:38,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 00:29:38,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 00:29:38,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 00:29:38,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 00:29:38,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 00:29:38,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 00:29:38,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 00:29:38,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-07-22 00:29:38,549 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 00:29:38,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 00:29:38,551 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 00:29:38,552 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 00:29:38,552 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 00:29:38,553 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 00:29:38,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 00:29:38,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 00:29:38,554 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 00:29:38,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 00:29:38,555 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 00:29:38,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 00:29:38,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 00:29:38,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 00:29:38,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 00:29:38,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 00:29:38,556 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-22 00:29:38,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 00:29:38,557 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 00:29:38,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 00:29:38,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 00:29:38,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 00:29:38,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 00:29:38,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 00:29:38,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 00:29:38,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 00:29:38,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 00:29:38,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 00:29:38,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 00:29:38,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 00:29:38,560 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 -> 9948dbd77aeb2de72e0bd3a3a4e22b1606b19383e4631af58adbec46ed909b6c [2022-07-22 00:29:38,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 00:29:38,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 00:29:38,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 00:29:38,915 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 00:29:38,916 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 00:29:38,917 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2022-07-22 00:29:38,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b595ec309/8cfc39b9aaea46e18bef2e689d858bc9/FLAGcd0a7640a [2022-07-22 00:29:39,458 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 00:29:39,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2022-07-22 00:29:39,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b595ec309/8cfc39b9aaea46e18bef2e689d858bc9/FLAGcd0a7640a [2022-07-22 00:29:39,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b595ec309/8cfc39b9aaea46e18bef2e689d858bc9 [2022-07-22 00:29:39,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 00:29:39,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 00:29:39,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 00:29:39,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 00:29:39,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 00:29:39,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:29:39" (1/1) ... [2022-07-22 00:29:39,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b68a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:29:39, skipping insertion in model container [2022-07-22 00:29:39,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:29:39" (1/1) ... [2022-07-22 00:29:39,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 00:29:39,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 00:29:40,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 00:29:40,129 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 00:29:40,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 00:29:40,164 INFO L208 MainTranslator]: Completed translation [2022-07-22 00:29:40,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:29:40 WrapperNode [2022-07-22 00:29:40,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 00:29:40,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 00:29:40,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 00:29:40,168 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 00:29:40,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:29:40" (1/1) ... [2022-07-22 00:29:40,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:29:40" (1/1) ... [2022-07-22 00:29:40,200 INFO L137 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 8 [2022-07-22 00:29:40,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 00:29:40,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 00:29:40,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 00:29:40,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 00:29:40,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:29:40" (1/1) ... [2022-07-22 00:29:40,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:29:40" (1/1) ... [2022-07-22 00:29:40,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:29:40" (1/1) ... [2022-07-22 00:29:40,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:29:40" (1/1) ... [2022-07-22 00:29:40,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:29:40" (1/1) ... [2022-07-22 00:29:40,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:29:40" (1/1) ... [2022-07-22 00:29:40,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:29:40" (1/1) ... [2022-07-22 00:29:40,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 00:29:40,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 00:29:40,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 00:29:40,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 00:29:40,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:29:40" (1/1) ... [2022-07-22 00:29:40,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 00:29:40,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:29:40,261 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-22 00:29:40,291 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-22 00:29:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2022-07-22 00:29:40,318 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2022-07-22 00:29:40,319 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2022-07-22 00:29:40,319 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2022-07-22 00:29:40,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 00:29:40,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 00:29:40,369 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 00:29:40,371 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 00:29:40,545 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 00:29:40,562 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 00:29:40,563 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 00:29:40,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:29:40 BoogieIcfgContainer [2022-07-22 00:29:40,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 00:29:40,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 00:29:40,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 00:29:40,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 00:29:40,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 12:29:39" (1/3) ... [2022-07-22 00:29:40,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17160992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 12:29:40, skipping insertion in model container [2022-07-22 00:29:40,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:29:40" (2/3) ... [2022-07-22 00:29:40,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17160992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 12:29:40, skipping insertion in model container [2022-07-22 00:29:40,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:29:40" (3/3) ... [2022-07-22 00:29:40,572 INFO L111 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b.c [2022-07-22 00:29:40,586 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 00:29:40,586 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-07-22 00:29:40,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 00:29:40,678 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@586f5cc2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ba6a891 [2022-07-22 00:29:40,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-07-22 00:29:40,682 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-22 00:29:40,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-22 00:29:40,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:40,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-22 00:29:40,697 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:40,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2132374368, now seen corresponding path program 1 times [2022-07-22 00:29:40,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:40,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324019186] [2022-07-22 00:29:40,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:40,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:40,895 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-22 00:29:40,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:40,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324019186] [2022-07-22 00:29:40,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324019186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:40,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:29:40,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 00:29:40,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495681376] [2022-07-22 00:29:40,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:40,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:29:40,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:40,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:29:40,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 00:29:40,938 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 36 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:29:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:41,068 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-07-22 00:29:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:29:41,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-22 00:29:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:41,082 INFO L225 Difference]: With dead ends: 63 [2022-07-22 00:29:41,082 INFO L226 Difference]: Without dead ends: 56 [2022-07-22 00:29:41,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:29:41,092 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:41,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 167 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:29:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-22 00:29:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-07-22 00:29:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 40 states have internal predecessors, (45), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-22 00:29:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-07-22 00:29:41,144 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 6 [2022-07-22 00:29:41,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:41,145 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-07-22 00:29:41,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:29:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-07-22 00:29:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-22 00:29:41,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:41,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:41,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 00:29:41,147 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:41,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1679096030, now seen corresponding path program 1 times [2022-07-22 00:29:41,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:41,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581234880] [2022-07-22 00:29:41,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:41,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:41,165 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-22 00:29:41,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:41,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581234880] [2022-07-22 00:29:41,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581234880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:41,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:29:41,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 00:29:41,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674897180] [2022-07-22 00:29:41,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:41,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:29:41,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:41,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:29:41,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:29:41,169 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:29:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:41,183 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-07-22 00:29:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:29:41,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-22 00:29:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:41,185 INFO L225 Difference]: With dead ends: 53 [2022-07-22 00:29:41,185 INFO L226 Difference]: Without dead ends: 52 [2022-07-22 00:29:41,185 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-22 00:29:41,186 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:41,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 74 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:29:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-22 00:29:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-07-22 00:29:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 39 states have internal predecessors, (43), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-22 00:29:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-07-22 00:29:41,197 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 7 [2022-07-22 00:29:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:41,198 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-07-22 00:29:41,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:29:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-07-22 00:29:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 00:29:41,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:41,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:41,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 00:29:41,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:41,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash -315038040, now seen corresponding path program 1 times [2022-07-22 00:29:41,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:41,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627168145] [2022-07-22 00:29:41,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:41,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:41,249 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-22 00:29:41,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:41,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627168145] [2022-07-22 00:29:41,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627168145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:41,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:29:41,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 00:29:41,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949864804] [2022-07-22 00:29:41,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:41,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 00:29:41,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:41,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 00:29:41,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:29:41,253 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-22 00:29:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:41,378 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2022-07-22 00:29:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 00:29:41,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2022-07-22 00:29:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:41,380 INFO L225 Difference]: With dead ends: 78 [2022-07-22 00:29:41,380 INFO L226 Difference]: Without dead ends: 77 [2022-07-22 00:29:41,381 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-22 00:29:41,382 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 50 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:41,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 219 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:29:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-22 00:29:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2022-07-22 00:29:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 51 states have internal predecessors, (61), 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-22 00:29:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2022-07-22 00:29:41,395 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 11 [2022-07-22 00:29:41,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:41,395 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2022-07-22 00:29:41,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-22 00:29:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2022-07-22 00:29:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 00:29:41,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:41,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:41,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 00:29:41,397 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:41,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:41,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1176244610, now seen corresponding path program 1 times [2022-07-22 00:29:41,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:41,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331434112] [2022-07-22 00:29:41,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:41,416 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-22 00:29:41,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:41,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331434112] [2022-07-22 00:29:41,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331434112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:41,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:29:41,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 00:29:41,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938038730] [2022-07-22 00:29:41,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:41,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:29:41,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:41,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:29:41,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:29:41,423 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-22 00:29:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:41,463 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2022-07-22 00:29:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:29:41,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2022-07-22 00:29:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:41,465 INFO L225 Difference]: With dead ends: 70 [2022-07-22 00:29:41,465 INFO L226 Difference]: Without dead ends: 69 [2022-07-22 00:29:41,466 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-22 00:29:41,467 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 69 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-22 00:29:41,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:29:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-22 00:29:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2022-07-22 00:29:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.372093023255814) internal successors, (59), 50 states have internal predecessors, (59), 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-22 00:29:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2022-07-22 00:29:41,491 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 12 [2022-07-22 00:29:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:41,491 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2022-07-22 00:29:41,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-22 00:29:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2022-07-22 00:29:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 00:29:41,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:41,493 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:41,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 00:29:41,493 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:41,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:41,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1729649667, now seen corresponding path program 1 times [2022-07-22 00:29:41,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:41,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580530993] [2022-07-22 00:29:41,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:41,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 00:29:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:29:41,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:41,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580530993] [2022-07-22 00:29:41,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580530993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:41,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:29:41,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 00:29:41,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908561813] [2022-07-22 00:29:41,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:41,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 00:29:41,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:41,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 00:29:41,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:29:41,573 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 00:29:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:41,620 INFO L93 Difference]: Finished difference Result 126 states and 161 transitions. [2022-07-22 00:29:41,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 00:29:41,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-22 00:29:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:41,622 INFO L225 Difference]: With dead ends: 126 [2022-07-22 00:29:41,622 INFO L226 Difference]: Without dead ends: 87 [2022-07-22 00:29:41,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:29:41,625 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:41,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 192 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:29:41,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-22 00:29:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2022-07-22 00:29:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.32) internal successors, (66), 59 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2022-07-22 00:29:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2022-07-22 00:29:41,641 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 17 [2022-07-22 00:29:41,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:41,642 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2022-07-22 00:29:41,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 00:29:41,642 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2022-07-22 00:29:41,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 00:29:41,647 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:41,647 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:41,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 00:29:41,647 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:41,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:41,648 INFO L85 PathProgramCache]: Analyzing trace with hash 643212051, now seen corresponding path program 1 times [2022-07-22 00:29:41,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:41,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897503953] [2022-07-22 00:29:41,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:41,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:41,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:41,694 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-22 00:29:41,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:41,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897503953] [2022-07-22 00:29:41,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897503953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:41,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:29:41,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 00:29:41,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826965029] [2022-07-22 00:29:41,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:41,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:29:41,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:41,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:29:41,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:29:41,708 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 00:29:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:41,731 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2022-07-22 00:29:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:29:41,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-22 00:29:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:41,733 INFO L225 Difference]: With dead ends: 77 [2022-07-22 00:29:41,734 INFO L226 Difference]: Without dead ends: 76 [2022-07-22 00:29:41,734 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-22 00:29:41,735 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-22 00:29:41,736 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-22 00:29:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-22 00:29:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-07-22 00:29:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.28) internal successors, (64), 58 states have internal predecessors, (64), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2022-07-22 00:29:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-07-22 00:29:41,759 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 19 [2022-07-22 00:29:41,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:41,760 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-07-22 00:29:41,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 00:29:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-07-22 00:29:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 00:29:41,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:41,762 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:41,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 00:29:41,762 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1270071308, now seen corresponding path program 1 times [2022-07-22 00:29:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:41,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306875593] [2022-07-22 00:29:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:41,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 00:29:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:41,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 00:29:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:41,794 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-22 00:29:41,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:41,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306875593] [2022-07-22 00:29:41,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306875593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:41,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:29:41,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 00:29:41,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648009934] [2022-07-22 00:29:41,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:41,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:29:41,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:41,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:29:41,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:29:41,797 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 00:29:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:41,807 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2022-07-22 00:29:41,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:29:41,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-07-22 00:29:41,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:41,808 INFO L225 Difference]: With dead ends: 76 [2022-07-22 00:29:41,809 INFO L226 Difference]: Without dead ends: 75 [2022-07-22 00:29:41,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:29:41,810 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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-22 00:29:41,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 77 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:29:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-22 00:29:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-22 00:29:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 57 states have internal predecessors, (62), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2022-07-22 00:29:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2022-07-22 00:29:41,824 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 20 [2022-07-22 00:29:41,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:41,824 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2022-07-22 00:29:41,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 00:29:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-07-22 00:29:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 00:29:41,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:41,825 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:41,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 00:29:41,826 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:41,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:41,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1535262855, now seen corresponding path program 1 times [2022-07-22 00:29:41,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:41,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816292695] [2022-07-22 00:29:41,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:41,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:41,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:41,886 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-22 00:29:41,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:41,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816292695] [2022-07-22 00:29:41,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816292695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:41,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:29:41,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:29:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180539562] [2022-07-22 00:29:41,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:41,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:29:41,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:41,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:29:41,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:29:41,889 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 00:29:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:41,915 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2022-07-22 00:29:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 00:29:41,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-22 00:29:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:41,917 INFO L225 Difference]: With dead ends: 96 [2022-07-22 00:29:41,917 INFO L226 Difference]: Without dead ends: 95 [2022-07-22 00:29:41,918 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-22 00:29:41,919 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 109 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-22 00:29:41,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 109 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:29:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-22 00:29:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2022-07-22 00:29:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 61 states have internal predecessors, (68), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (20), 14 states have call predecessors, (20), 12 states have call successors, (20) [2022-07-22 00:29:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2022-07-22 00:29:41,938 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 20 [2022-07-22 00:29:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:41,939 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2022-07-22 00:29:41,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 00:29:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2022-07-22 00:29:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 00:29:41,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:41,939 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:41,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 00:29:41,940 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:41,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:41,940 INFO L85 PathProgramCache]: Analyzing trace with hash 717504954, now seen corresponding path program 1 times [2022-07-22 00:29:41,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:41,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744190149] [2022-07-22 00:29:41,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:41,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:41,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 00:29:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:41,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 00:29:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,001 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-22 00:29:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:42,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744190149] [2022-07-22 00:29:42,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744190149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:42,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:29:42,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:29:42,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707244579] [2022-07-22 00:29:42,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:42,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:29:42,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:42,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:29:42,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:29:42,009 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 00:29:42,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:42,034 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-07-22 00:29:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 00:29:42,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-07-22 00:29:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:42,037 INFO L225 Difference]: With dead ends: 90 [2022-07-22 00:29:42,037 INFO L226 Difference]: Without dead ends: 84 [2022-07-22 00:29:42,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:29:42,039 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:42,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:29:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-22 00:29:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-22 00:29:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 64 states have internal predecessors, (71), 12 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (19), 14 states have call predecessors, (19), 11 states have call successors, (19) [2022-07-22 00:29:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2022-07-22 00:29:42,061 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 21 [2022-07-22 00:29:42,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:42,062 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2022-07-22 00:29:42,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 00:29:42,066 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2022-07-22 00:29:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 00:29:42,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:42,067 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:42,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 00:29:42,067 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:42,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:42,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1470818745, now seen corresponding path program 1 times [2022-07-22 00:29:42,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:42,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492712533] [2022-07-22 00:29:42,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:42,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,122 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-22 00:29:42,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:42,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492712533] [2022-07-22 00:29:42,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492712533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:42,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:29:42,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 00:29:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215246491] [2022-07-22 00:29:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:42,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 00:29:42,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:42,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 00:29:42,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:29:42,124 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-22 00:29:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:42,238 INFO L93 Difference]: Finished difference Result 168 states and 223 transitions. [2022-07-22 00:29:42,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 00:29:42,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2022-07-22 00:29:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:42,243 INFO L225 Difference]: With dead ends: 168 [2022-07-22 00:29:42,243 INFO L226 Difference]: Without dead ends: 102 [2022-07-22 00:29:42,245 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-22 00:29:42,246 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:42,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 182 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:29:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-22 00:29:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2022-07-22 00:29:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 69 states have internal predecessors, (74), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (21), 14 states have call predecessors, (21), 13 states have call successors, (21) [2022-07-22 00:29:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2022-07-22 00:29:42,263 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 24 [2022-07-22 00:29:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:42,264 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2022-07-22 00:29:42,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-22 00:29:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-07-22 00:29:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-22 00:29:42,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:42,265 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:42,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 00:29:42,265 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:42,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:42,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1187119334, now seen corresponding path program 1 times [2022-07-22 00:29:42,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:42,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973290920] [2022-07-22 00:29:42,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:42,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 00:29:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 00:29:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 00:29:42,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:42,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973290920] [2022-07-22 00:29:42,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973290920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:42,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:29:42,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 00:29:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214938487] [2022-07-22 00:29:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:42,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 00:29:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 00:29:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:29:42,341 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-22 00:29:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:42,391 INFO L93 Difference]: Finished difference Result 177 states and 227 transitions. [2022-07-22 00:29:42,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 00:29:42,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 35 [2022-07-22 00:29:42,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:42,397 INFO L225 Difference]: With dead ends: 177 [2022-07-22 00:29:42,397 INFO L226 Difference]: Without dead ends: 106 [2022-07-22 00:29:42,397 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-22 00:29:42,398 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:42,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 186 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:29:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-22 00:29:42,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2022-07-22 00:29:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 74 states have internal predecessors, (79), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-22 00:29:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-07-22 00:29:42,417 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 35 [2022-07-22 00:29:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:42,417 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-07-22 00:29:42,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-22 00:29:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-07-22 00:29:42,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-22 00:29:42,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:42,418 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, 1] [2022-07-22 00:29:42,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 00:29:42,419 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:42,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:42,419 INFO L85 PathProgramCache]: Analyzing trace with hash -711697781, now seen corresponding path program 1 times [2022-07-22 00:29:42,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:42,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697901933] [2022-07-22 00:29:42,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:42,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 00:29:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 00:29:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 00:29:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 00:29:42,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:42,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697901933] [2022-07-22 00:29:42,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697901933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:42,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:29:42,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:29:42,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981750992] [2022-07-22 00:29:42,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:42,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:29:42,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:42,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:29:42,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:29:42,494 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-22 00:29:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:42,515 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2022-07-22 00:29:42,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 00:29:42,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 38 [2022-07-22 00:29:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:42,517 INFO L225 Difference]: With dead ends: 105 [2022-07-22 00:29:42,517 INFO L226 Difference]: Without dead ends: 104 [2022-07-22 00:29:42,518 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-22 00:29:42,519 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:42,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:29:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-22 00:29:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2022-07-22 00:29:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 76 states have internal predecessors, (83), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-22 00:29:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2022-07-22 00:29:42,528 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 38 [2022-07-22 00:29:42,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:42,528 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2022-07-22 00:29:42,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-22 00:29:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2022-07-22 00:29:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 00:29:42,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:42,530 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, 1, 1, 1] [2022-07-22 00:29:42,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 00:29:42,530 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:42,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash 750310703, now seen corresponding path program 1 times [2022-07-22 00:29:42,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:42,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110491285] [2022-07-22 00:29:42,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:42,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 00:29:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 00:29:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 00:29:42,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:42,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110491285] [2022-07-22 00:29:42,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110491285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:42,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:29:42,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 00:29:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910979729] [2022-07-22 00:29:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:42,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:29:42,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:42,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:29:42,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:29:42,566 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-22 00:29:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:42,580 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2022-07-22 00:29:42,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:29:42,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 34 [2022-07-22 00:29:42,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:42,582 INFO L225 Difference]: With dead ends: 102 [2022-07-22 00:29:42,582 INFO L226 Difference]: Without dead ends: 101 [2022-07-22 00:29:42,582 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-22 00:29:42,583 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:42,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:29:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-22 00:29:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-22 00:29:42,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 75 states have internal predecessors, (81), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-22 00:29:42,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2022-07-22 00:29:42,592 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 34 [2022-07-22 00:29:42,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:42,592 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2022-07-22 00:29:42,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-22 00:29:42,592 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2022-07-22 00:29:42,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 00:29:42,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:42,594 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:42,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 00:29:42,594 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:42,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:42,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1547129285, now seen corresponding path program 1 times [2022-07-22 00:29:42,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:42,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365059957] [2022-07-22 00:29:42,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:42,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 00:29:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 00:29:42,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:42,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365059957] [2022-07-22 00:29:42,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365059957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:42,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:29:42,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 00:29:42,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861636466] [2022-07-22 00:29:42,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:42,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 00:29:42,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:42,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 00:29:42,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:29:42,675 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-22 00:29:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:42,721 INFO L93 Difference]: Finished difference Result 111 states and 132 transitions. [2022-07-22 00:29:42,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 00:29:42,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 44 [2022-07-22 00:29:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:42,723 INFO L225 Difference]: With dead ends: 111 [2022-07-22 00:29:42,723 INFO L226 Difference]: Without dead ends: 110 [2022-07-22 00:29:42,723 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-22 00:29:42,724 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 152 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-22 00:29:42,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 152 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:29:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-22 00:29:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2022-07-22 00:29:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 74 states have internal predecessors, (79), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-22 00:29:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2022-07-22 00:29:42,731 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 44 [2022-07-22 00:29:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:42,732 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2022-07-22 00:29:42,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-22 00:29:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2022-07-22 00:29:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 00:29:42,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:42,734 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:42,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 00:29:42,734 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1933353649, now seen corresponding path program 1 times [2022-07-22 00:29:42,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:42,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537161128] [2022-07-22 00:29:42,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 00:29:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 00:29:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,836 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 00:29:42,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:42,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537161128] [2022-07-22 00:29:42,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537161128] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:29:42,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628604876] [2022-07-22 00:29:42,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:42,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:29:42,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:29:42,843 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-22 00:29:42,876 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-22 00:29:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:42,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 00:29:42,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:29:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 00:29:42,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:29:42,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628604876] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:42,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:29:42,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2022-07-22 00:29:42,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12519531] [2022-07-22 00:29:42,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:42,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 00:29:42,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:42,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 00:29:42,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-22 00:29:42,990 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 00:29:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:43,090 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2022-07-22 00:29:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 00:29:43,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-07-22 00:29:43,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:43,092 INFO L225 Difference]: With dead ends: 101 [2022-07-22 00:29:43,092 INFO L226 Difference]: Without dead ends: 100 [2022-07-22 00:29:43,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-07-22 00:29:43,093 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 25 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:43,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 186 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:29:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-22 00:29:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-07-22 00:29:43,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-22 00:29:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2022-07-22 00:29:43,101 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 41 [2022-07-22 00:29:43,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:43,101 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2022-07-22 00:29:43,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 00:29:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2022-07-22 00:29:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-22 00:29:43,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:43,103 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:43,147 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-22 00:29:43,319 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,SelfDestructingSolverStorable14 [2022-07-22 00:29:43,320 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:43,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:43,320 INFO L85 PathProgramCache]: Analyzing trace with hash -383475053, now seen corresponding path program 1 times [2022-07-22 00:29:43,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:43,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359732266] [2022-07-22 00:29:43,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:43,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:43,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:43,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:43,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:43,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 00:29:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 00:29:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:43,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359732266] [2022-07-22 00:29:43,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359732266] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:29:43,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052143934] [2022-07-22 00:29:43,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:43,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:29:43,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:29:43,443 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-22 00:29:43,444 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-22 00:29:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:43,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 00:29:43,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:29:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 00:29:43,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:29:43,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052143934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:43,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:29:43,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2022-07-22 00:29:43,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166083896] [2022-07-22 00:29:43,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:43,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 00:29:43,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:43,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 00:29:43,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-22 00:29:43,562 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 00:29:43,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:43,706 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2022-07-22 00:29:43,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 00:29:43,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-07-22 00:29:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:43,709 INFO L225 Difference]: With dead ends: 127 [2022-07-22 00:29:43,709 INFO L226 Difference]: Without dead ends: 126 [2022-07-22 00:29:43,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-07-22 00:29:43,710 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:43,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 190 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:29:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-22 00:29:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-07-22 00:29:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.1) internal successors, (99), 92 states have internal predecessors, (99), 21 states have call successors, (21), 8 states have call predecessors, (21), 11 states have return successors, (31), 24 states have call predecessors, (31), 20 states have call successors, (31) [2022-07-22 00:29:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2022-07-22 00:29:43,723 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 48 [2022-07-22 00:29:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:43,725 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2022-07-22 00:29:43,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 00:29:43,725 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2022-07-22 00:29:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-22 00:29:43,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:43,727 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:43,755 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-22 00:29:43,945 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,SelfDestructingSolverStorable15 [2022-07-22 00:29:43,946 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:43,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash 841931289, now seen corresponding path program 1 times [2022-07-22 00:29:43,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:43,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266447147] [2022-07-22 00:29:43,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:43,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:43,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 00:29:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 00:29:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 00:29:44,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:44,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266447147] [2022-07-22 00:29:44,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266447147] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:29:44,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955804610] [2022-07-22 00:29:44,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:44,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:29:44,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:29:44,040 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 00:29:44,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 00:29:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 00:29:44,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:29:44,121 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 00:29:44,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:29:44,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955804610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:29:44,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:29:44,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2022-07-22 00:29:44,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842090392] [2022-07-22 00:29:44,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:29:44,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:29:44,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:44,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:29:44,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-22 00:29:44,124 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 00:29:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:44,184 INFO L93 Difference]: Finished difference Result 153 states and 186 transitions. [2022-07-22 00:29:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:29:44,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-07-22 00:29:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:44,187 INFO L225 Difference]: With dead ends: 153 [2022-07-22 00:29:44,187 INFO L226 Difference]: Without dead ends: 152 [2022-07-22 00:29:44,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-22 00:29:44,189 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:44,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 108 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:29:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-22 00:29:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2022-07-22 00:29:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.1009174311926606) internal successors, (120), 111 states have internal predecessors, (120), 26 states have call successors, (26), 9 states have call predecessors, (26), 13 states have return successors, (39), 30 states have call predecessors, (39), 25 states have call successors, (39) [2022-07-22 00:29:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 185 transitions. [2022-07-22 00:29:44,205 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 185 transitions. Word has length 46 [2022-07-22 00:29:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:44,206 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 185 transitions. [2022-07-22 00:29:44,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 00:29:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 185 transitions. [2022-07-22 00:29:44,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-22 00:29:44,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:44,210 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:44,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 00:29:44,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:29:44,435 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:44,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:44,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1248044793, now seen corresponding path program 1 times [2022-07-22 00:29:44,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:44,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58356415] [2022-07-22 00:29:44,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:44,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 00:29:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 00:29:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 00:29:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 00:29:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-22 00:29:44,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:44,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58356415] [2022-07-22 00:29:44,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58356415] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:29:44,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056760305] [2022-07-22 00:29:44,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:44,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:29:44,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:29:44,512 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 00:29:44,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 00:29:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 00:29:44,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:29:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-22 00:29:44,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:29:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-22 00:29:44,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056760305] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:29:44,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:29:44,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-22 00:29:44,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147445101] [2022-07-22 00:29:44,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:29:44,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 00:29:44,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:44,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 00:29:44,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-22 00:29:44,703 INFO L87 Difference]: Start difference. First operand 151 states and 185 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-22 00:29:44,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:44,733 INFO L93 Difference]: Finished difference Result 176 states and 215 transitions. [2022-07-22 00:29:44,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 00:29:44,734 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2022-07-22 00:29:44,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:44,736 INFO L225 Difference]: With dead ends: 176 [2022-07-22 00:29:44,736 INFO L226 Difference]: Without dead ends: 166 [2022-07-22 00:29:44,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-22 00:29:44,737 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:44,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:29:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-22 00:29:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-07-22 00:29:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 121 states have (on average 1.0909090909090908) internal successors, (132), 123 states have internal predecessors, (132), 26 states have call successors, (26), 9 states have call predecessors, (26), 16 states have return successors, (42), 33 states have call predecessors, (42), 25 states have call successors, (42) [2022-07-22 00:29:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 200 transitions. [2022-07-22 00:29:44,747 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 200 transitions. Word has length 61 [2022-07-22 00:29:44,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:44,748 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 200 transitions. [2022-07-22 00:29:44,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-22 00:29:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 200 transitions. [2022-07-22 00:29:44,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-22 00:29:44,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:44,749 INFO L195 NwaCegarLoop]: trace histogram [11, 8, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:44,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 00:29:44,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-22 00:29:44,965 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:44,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:44,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2134329678, now seen corresponding path program 2 times [2022-07-22 00:29:44,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:44,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601072692] [2022-07-22 00:29:44,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:44,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:44,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 00:29:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 00:29:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 00:29:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 00:29:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 71 proven. 28 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-22 00:29:45,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:45,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601072692] [2022-07-22 00:29:45,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601072692] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:29:45,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097351060] [2022-07-22 00:29:45,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 00:29:45,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:29:45,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:29:45,064 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 00:29:45,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 00:29:45,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 00:29:45,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 00:29:45,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 00:29:45,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:29:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 71 proven. 28 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-22 00:29:45,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:29:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 71 proven. 28 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-22 00:29:45,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097351060] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:29:45,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:29:45,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-07-22 00:29:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606958114] [2022-07-22 00:29:45,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:29:45,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 00:29:45,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 00:29:45,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-22 00:29:45,315 INFO L87 Difference]: Start difference. First operand 166 states and 200 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-22 00:29:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:45,397 INFO L93 Difference]: Finished difference Result 273 states and 334 transitions. [2022-07-22 00:29:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 00:29:45,398 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 83 [2022-07-22 00:29:45,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:45,399 INFO L225 Difference]: With dead ends: 273 [2022-07-22 00:29:45,399 INFO L226 Difference]: Without dead ends: 108 [2022-07-22 00:29:45,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 178 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-07-22 00:29:45,400 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:45,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 138 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:29:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-22 00:29:45,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2022-07-22 00:29:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.056338028169014) internal successors, (75), 73 states have internal predecessors, (75), 12 states have call successors, (12), 7 states have call predecessors, (12), 12 states have return successors, (18), 15 states have call predecessors, (18), 11 states have call successors, (18) [2022-07-22 00:29:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-07-22 00:29:45,407 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 83 [2022-07-22 00:29:45,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:45,407 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-07-22 00:29:45,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-22 00:29:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-07-22 00:29:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-22 00:29:45,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:29:45,409 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 13, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2022-07-22 00:29:45,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 00:29:45,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:29:45,633 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-07-22 00:29:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:29:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash -321457158, now seen corresponding path program 2 times [2022-07-22 00:29:45,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:29:45,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782483831] [2022-07-22 00:29:45,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:29:45,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:29:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 00:29:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 00:29:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 00:29:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 00:29:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 00:29:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 00:29:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 00:29:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 00:29:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 00:29:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 00:29:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 00:29:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 00:29:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:29:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 64 proven. 144 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2022-07-22 00:29:45,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:29:45,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782483831] [2022-07-22 00:29:45,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782483831] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:29:45,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166275168] [2022-07-22 00:29:45,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 00:29:45,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:29:45,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:29:45,861 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 00:29:45,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 00:29:45,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 00:29:45,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 00:29:45,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 00:29:45,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:29:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 64 proven. 144 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2022-07-22 00:29:46,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:29:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 64 proven. 144 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2022-07-22 00:29:46,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166275168] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:29:46,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:29:46,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2022-07-22 00:29:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561206195] [2022-07-22 00:29:46,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:29:46,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 00:29:46,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:29:46,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 00:29:46,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-07-22 00:29:46,453 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-22 00:29:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:29:46,601 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-07-22 00:29:46,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 00:29:46,602 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) Word has length 181 [2022-07-22 00:29:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:29:46,602 INFO L225 Difference]: With dead ends: 106 [2022-07-22 00:29:46,602 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 00:29:46,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 397 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2022-07-22 00:29:46,604 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:29:46,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 142 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:29:46,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 00:29:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 00:29:46,605 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-22 00:29:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 00:29:46,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 181 [2022-07-22 00:29:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:29:46,605 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 00:29:46,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-22 00:29:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 00:29:46,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 00:29:46,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-07-22 00:29:46,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-07-22 00:29:46,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-07-22 00:29:46,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-07-22 00:29:46,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-07-22 00:29:46,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-07-22 00:29:46,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-07-22 00:29:46,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-07-22 00:29:46,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-07-22 00:29:46,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-07-22 00:29:46,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 00:29:46,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:29:46,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 00:29:47,165 INFO L899 garLoopResultBuilder]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,166 INFO L899 garLoopResultBuilder]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2022-07-22 00:29:47,166 INFO L899 garLoopResultBuilder]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,166 INFO L899 garLoopResultBuilder]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2022-07-22 00:29:47,166 INFO L899 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,166 INFO L902 garLoopResultBuilder]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2022-07-22 00:29:47,166 INFO L899 garLoopResultBuilder]: For program point L14-1(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,166 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2022-07-22 00:29:47,166 INFO L895 garLoopResultBuilder]: At program point L14-2(line 14) the Hoare annotation is: (and (not (<= |rec1_#in~i| 2147483646)) (or (= |rec1_#in~i| rec1_~i) (not (<= |rec1_#in~i| 2147483647)))) [2022-07-22 00:29:47,166 INFO L899 garLoopResultBuilder]: For program point L14-3(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,166 INFO L899 garLoopResultBuilder]: For program point L14-4(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,167 INFO L899 garLoopResultBuilder]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,167 INFO L899 garLoopResultBuilder]: For program point L14-5(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,167 INFO L895 garLoopResultBuilder]: At program point L14-6(line 14) the Hoare annotation is: (and (not (<= |rec1_#in~i| 2147483646)) (or (and (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) (not (<= |rec1_#in~i| 2147483647)))) [2022-07-22 00:29:47,167 INFO L899 garLoopResultBuilder]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,167 INFO L899 garLoopResultBuilder]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,167 INFO L899 garLoopResultBuilder]: For program point L14-7(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,167 INFO L899 garLoopResultBuilder]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,167 INFO L895 garLoopResultBuilder]: At program point L14-8(line 14) the Hoare annotation is: (and (not (<= |rec1_#in~i| 2147483646)) (or (and (<= |rec1_#t~ret1| 0) (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) (not (<= |rec1_#in~i| 2147483647)))) [2022-07-22 00:29:47,167 INFO L899 garLoopResultBuilder]: For program point L14-9(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,168 INFO L899 garLoopResultBuilder]: For program point L14-10(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,168 INFO L899 garLoopResultBuilder]: For program point L14-11(line 14) no Hoare annotation was computed. [2022-07-22 00:29:47,168 INFO L899 garLoopResultBuilder]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-07-22 00:29:47,168 INFO L899 garLoopResultBuilder]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2022-07-22 00:29:47,168 INFO L899 garLoopResultBuilder]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2022-07-22 00:29:47,168 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-07-22 00:29:47,168 INFO L899 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-07-22 00:29:47,168 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 19) no Hoare annotation was computed. [2022-07-22 00:29:47,168 INFO L895 garLoopResultBuilder]: At program point L20-2(line 20) the Hoare annotation is: (and (not (<= |rec2_#in~j| 0)) (or (not (<= |rec2_#in~j| 2147483647)) (= rec2_~j |rec2_#in~j|))) [2022-07-22 00:29:47,168 INFO L899 garLoopResultBuilder]: For program point L20-3(line 20) no Hoare annotation was computed. [2022-07-22 00:29:47,169 INFO L895 garLoopResultBuilder]: At program point L20-4(line 20) the Hoare annotation is: (and (let ((.cse0 (= rec2_~j |rec2_#in~j|))) (or (and (<= 2 |rec2_#in~j|) (<= |rec2_#t~ret3| 1) .cse0) (not (<= |rec2_#in~j| 2147483647)) (and (<= |rec2_#t~ret3| 0) .cse0))) (not (<= |rec2_#in~j| 0))) [2022-07-22 00:29:47,169 INFO L899 garLoopResultBuilder]: For program point L20-5(line 20) no Hoare annotation was computed. [2022-07-22 00:29:47,169 INFO L899 garLoopResultBuilder]: For program point L20-6(line 20) no Hoare annotation was computed. [2022-07-22 00:29:47,169 INFO L899 garLoopResultBuilder]: For program point L20-7(line 20) no Hoare annotation was computed. [2022-07-22 00:29:47,169 INFO L902 garLoopResultBuilder]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2022-07-22 00:29:47,169 INFO L899 garLoopResultBuilder]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-07-22 00:29:47,169 INFO L899 garLoopResultBuilder]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-07-22 00:29:47,169 INFO L899 garLoopResultBuilder]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-07-22 00:29:47,169 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 00:29:47,169 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 00:29:47,169 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 00:29:47,170 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 00:29:47,170 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (<= |ULTIMATE.start_main_~x~0#1| 2147483647) [2022-07-22 00:29:47,170 INFO L899 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-07-22 00:29:47,170 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 26) no Hoare annotation was computed. [2022-07-22 00:29:47,173 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:29:47,175 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 00:29:47,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 12:29:47 BoogieIcfgContainer [2022-07-22 00:29:47,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 00:29:47,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 00:29:47,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 00:29:47,181 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 00:29:47,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:29:40" (3/4) ... [2022-07-22 00:29:47,184 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 00:29:47,189 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2022-07-22 00:29:47,189 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2022-07-22 00:29:47,196 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-22 00:29:47,196 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-22 00:29:47,196 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 00:29:47,235 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 00:29:47,235 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 00:29:47,236 INFO L158 Benchmark]: Toolchain (without parser) took 7279.04ms. Allocated memory was 52.4MB in the beginning and 98.6MB in the end (delta: 46.1MB). Free memory was 29.3MB in the beginning and 79.4MB in the end (delta: -50.1MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2022-07-22 00:29:47,236 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.9MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 00:29:47,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.12ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 29.1MB in the beginning and 51.6MB in the end (delta: -22.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-07-22 00:29:47,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.04ms. Allocated memory is still 67.1MB. Free memory was 51.6MB in the beginning and 50.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 00:29:47,238 INFO L158 Benchmark]: Boogie Preprocessor took 24.53ms. Allocated memory is still 67.1MB. Free memory was 50.3MB in the beginning and 49.5MB in the end (delta: 794.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 00:29:47,238 INFO L158 Benchmark]: RCFGBuilder took 336.18ms. Allocated memory is still 67.1MB. Free memory was 49.3MB in the beginning and 39.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 00:29:47,238 INFO L158 Benchmark]: TraceAbstraction took 6613.31ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 39.2MB in the beginning and 36.4MB in the end (delta: 2.8MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2022-07-22 00:29:47,239 INFO L158 Benchmark]: Witness Printer took 55.01ms. Allocated memory is still 98.6MB. Free memory was 36.4MB in the beginning and 79.4MB in the end (delta: -43.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 00:29:47,244 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.20ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.9MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.12ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 29.1MB in the beginning and 51.6MB in the end (delta: -22.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.04ms. Allocated memory is still 67.1MB. Free memory was 51.6MB in the beginning and 50.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.53ms. Allocated memory is still 67.1MB. Free memory was 50.3MB in the beginning and 49.5MB in the end (delta: 794.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 336.18ms. Allocated memory is still 67.1MB. Free memory was 49.3MB in the beginning and 39.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6613.31ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 39.2MB in the beginning and 36.4MB in the end (delta: 2.8MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * Witness Printer took 55.01ms. Allocated memory is still 98.6MB. Free memory was 36.4MB in the beginning and 79.4MB in the end (delta: -43.0MB). Peak memory consumption was 4.2MB. 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: 6.5s, OverallIterations: 20, TraceHistogramMax: 17, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 339 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 2703 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1919 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 875 IncrementalHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 784 mSDtfsCounter, 875 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 911 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=18, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 93 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 238 PreInvPairs, 263 NumberOfFragments, 95 HoareAnnotationTreeSize, 238 FomulaSimplifications, 189 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1129 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1228 NumberOfCodeBlocks, 1228 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1524 ConstructedInterpolants, 0 QuantifiedInterpolants, 2316 SizeOfPredicates, 6 NumberOfNonLiveVariables, 926 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 2858/3395 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-22 00:29:47,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE