./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0837a1e1d82be1b28ccf3514392f1b01c88a9160 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 10:41:22,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 10:41:22,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 10:41:22,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 10:41:22,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 10:41:22,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 10:41:22,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 10:41:22,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 10:41:22,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 10:41:22,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 10:41:22,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 10:41:22,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 10:41:22,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 10:41:22,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 10:41:22,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 10:41:22,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 10:41:22,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 10:41:22,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 10:41:22,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 10:41:22,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 10:41:22,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 10:41:22,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 10:41:22,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 10:41:22,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 10:41:22,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 10:41:22,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 10:41:22,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 10:41:22,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 10:41:22,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 10:41:22,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 10:41:22,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 10:41:22,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 10:41:22,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 10:41:22,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 10:41:22,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 10:41:22,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 10:41:22,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 10:41:22,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 10:41:22,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 10:41:22,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 10:41:22,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 10:41:22,653 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2021-08-27 10:41:22,680 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 10:41:22,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 10:41:22,681 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 10:41:22,682 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 10:41:22,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 10:41:22,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 10:41:22,683 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 10:41:22,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 10:41:22,684 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 10:41:22,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 10:41:22,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 10:41:22,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-27 10:41:22,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 10:41:22,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-27 10:41:22,692 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-08-27 10:41:22,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 10:41:22,692 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 10:41:22,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-27 10:41:22,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 10:41:22,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 10:41:22,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 10:41:22,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 10:41:22,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 10:41:22,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 10:41:22,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-27 10:41:22,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 10:41:22,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 10:41:22,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-27 10:41:22,694 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 10:41:22,694 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 -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2021-08-27 10:41:22,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 10:41:22,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 10:41:22,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 10:41:22,971 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 10:41:22,972 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 10:41:22,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2021-08-27 10:41:23,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81f6f9880/15b01b8c95f7483d9a8c3723a77be333/FLAG053bd9196 [2021-08-27 10:41:23,378 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 10:41:23,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2021-08-27 10:41:23,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81f6f9880/15b01b8c95f7483d9a8c3723a77be333/FLAG053bd9196 [2021-08-27 10:41:23,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81f6f9880/15b01b8c95f7483d9a8c3723a77be333 [2021-08-27 10:41:23,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 10:41:23,785 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 10:41:23,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 10:41:23,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 10:41:23,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 10:41:23,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:41:23" (1/1) ... [2021-08-27 10:41:23,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d42a44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:23, skipping insertion in model container [2021-08-27 10:41:23,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:41:23" (1/1) ... [2021-08-27 10:41:23,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 10:41:23,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 10:41:23,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 10:41:23,875 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 10:41:23,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 10:41:23,889 INFO L208 MainTranslator]: Completed translation [2021-08-27 10:41:23,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:23 WrapperNode [2021-08-27 10:41:23,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 10:41:23,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 10:41:23,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 10:41:23,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 10:41:23,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:23" (1/1) ... [2021-08-27 10:41:23,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:23" (1/1) ... [2021-08-27 10:41:23,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 10:41:23,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 10:41:23,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 10:41:23,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 10:41:23,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:23" (1/1) ... [2021-08-27 10:41:23,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:23" (1/1) ... [2021-08-27 10:41:23,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:23" (1/1) ... [2021-08-27 10:41:23,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:23" (1/1) ... [2021-08-27 10:41:23,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:23" (1/1) ... [2021-08-27 10:41:23,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:23" (1/1) ... [2021-08-27 10:41:23,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:23" (1/1) ... [2021-08-27 10:41:23,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 10:41:23,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 10:41:23,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 10:41:23,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 10:41:23,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:23" (1/1) ... [2021-08-27 10:41:23,960 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 10:41:23,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 10:41:23,982 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) [2021-08-27 10:41:24,025 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 [2021-08-27 10:41:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2021-08-27 10:41:24,040 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2021-08-27 10:41:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2021-08-27 10:41:24,040 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2021-08-27 10:41:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 10:41:24,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 10:41:24,249 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 10:41:24,261 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-27 10:41:24,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:41:24 BoogieIcfgContainer [2021-08-27 10:41:24,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 10:41:24,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 10:41:24,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 10:41:24,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 10:41:24,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:41:23" (1/3) ... [2021-08-27 10:41:24,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3ad7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:41:24, skipping insertion in model container [2021-08-27 10:41:24,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:23" (2/3) ... [2021-08-27 10:41:24,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3ad7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:41:24, skipping insertion in model container [2021-08-27 10:41:24,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:41:24" (3/3) ... [2021-08-27 10:41:24,268 INFO L111 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d.c [2021-08-27 10:41:24,271 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 10:41:24,271 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2021-08-27 10:41:24,311 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 10:41:24,322 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 10:41:24,322 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-08-27 10:41:24,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.48) internal successors, (37), 35 states have internal predecessors, (37), 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) [2021-08-27 10:41:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-27 10:41:24,340 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:24,340 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:24,341 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:24,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:24,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1656652383, now seen corresponding path program 1 times [2021-08-27 10:41:24,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:24,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322165303] [2021-08-27 10:41:24,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:24,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:24,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:24,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322165303] [2021-08-27 10:41:24,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322165303] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:24,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:24,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 10:41:24,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793946403] [2021-08-27 10:41:24,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 10:41:24,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:24,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 10:41:24,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 10:41:24,543 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.48) internal successors, (37), 35 states have internal predecessors, (37), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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) [2021-08-27 10:41:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:24,696 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2021-08-27 10:41:24,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 10:41:24,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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 8 [2021-08-27 10:41:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:24,703 INFO L225 Difference]: With dead ends: 86 [2021-08-27 10:41:24,704 INFO L226 Difference]: Without dead ends: 79 [2021-08-27 10:41:24,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 59.1ms TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 10:41:24,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-08-27 10:41:24,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2021-08-27 10:41:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.5) internal successors, (63), 51 states have internal predecessors, (63), 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) [2021-08-27 10:41:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2021-08-27 10:41:24,748 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 8 [2021-08-27 10:41:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:24,749 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2021-08-27 10:41:24,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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) [2021-08-27 10:41:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2021-08-27 10:41:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 10:41:24,750 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:24,750 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:24,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 10:41:24,751 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash -183383641, now seen corresponding path program 1 times [2021-08-27 10:41:24,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:24,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225951188] [2021-08-27 10:41:24,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:24,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:24,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:24,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225951188] [2021-08-27 10:41:24,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225951188] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:24,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:24,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 10:41:24,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635555803] [2021-08-27 10:41:24,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 10:41:24,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:24,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 10:41:24,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:24,786 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2021-08-27 10:41:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:24,797 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2021-08-27 10:41:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 10:41:24,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 9 [2021-08-27 10:41:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:24,815 INFO L225 Difference]: With dead ends: 70 [2021-08-27 10:41:24,815 INFO L226 Difference]: Without dead ends: 69 [2021-08-27 10:41:24,815 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:24,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-27 10:41:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2021-08-27 10:41:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 50 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) [2021-08-27 10:41:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2021-08-27 10:41:24,828 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 9 [2021-08-27 10:41:24,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:24,828 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2021-08-27 10:41:24,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2021-08-27 10:41:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2021-08-27 10:41:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 10:41:24,833 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:24,833 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:24,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 10:41:24,833 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:24,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:24,835 INFO L82 PathProgramCache]: Analyzing trace with hash -138388889, now seen corresponding path program 1 times [2021-08-27 10:41:24,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:24,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900476358] [2021-08-27 10:41:24,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:24,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:24,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:24,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:24,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900476358] [2021-08-27 10:41:24,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900476358] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:24,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:24,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 10:41:24,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864504247] [2021-08-27 10:41:24,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 10:41:24,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:24,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 10:41:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:24,882 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 10:41:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:24,891 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2021-08-27 10:41:24,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 10:41:24,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-27 10:41:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:24,896 INFO L225 Difference]: With dead ends: 65 [2021-08-27 10:41:24,896 INFO L226 Difference]: Without dead ends: 64 [2021-08-27 10:41:24,896 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-08-27 10:41:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-08-27 10:41:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 49 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) [2021-08-27 10:41:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2021-08-27 10:41:24,916 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 11 [2021-08-27 10:41:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:24,917 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2021-08-27 10:41:24,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 10:41:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2021-08-27 10:41:24,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 10:41:24,917 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:24,918 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:24,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 10:41:24,918 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:24,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:24,919 INFO L82 PathProgramCache]: Analyzing trace with hash 4911801, now seen corresponding path program 1 times [2021-08-27 10:41:24,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:24,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535255871] [2021-08-27 10:41:24,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:24,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:24,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:24,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:24,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535255871] [2021-08-27 10:41:24,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535255871] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:24,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:24,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 10:41:24,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422245750] [2021-08-27 10:41:24,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 10:41:24,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:24,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 10:41:24,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 10:41:24,964 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 10:41:24,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:24,992 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2021-08-27 10:41:24,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 10:41:24,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 10:41:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:24,994 INFO L225 Difference]: With dead ends: 85 [2021-08-27 10:41:24,994 INFO L226 Difference]: Without dead ends: 84 [2021-08-27 10:41:24,997 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 10:41:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-08-27 10:41:25,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2021-08-27 10:41:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.34) internal successors, (67), 57 states have internal predecessors, (67), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2021-08-27 10:41:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2021-08-27 10:41:25,006 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 12 [2021-08-27 10:41:25,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:25,007 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2021-08-27 10:41:25,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 10:41:25,007 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2021-08-27 10:41:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 10:41:25,008 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:25,008 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:25,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 10:41:25,008 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:25,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:25,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2115393736, now seen corresponding path program 1 times [2021-08-27 10:41:25,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:25,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517987478] [2021-08-27 10:41:25,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:25,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 10:41:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 10:41:25,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:25,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517987478] [2021-08-27 10:41:25,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517987478] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:25,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:25,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 10:41:25,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856620617] [2021-08-27 10:41:25,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 10:41:25,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:25,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 10:41:25,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:25,035 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2021-08-27 10:41:25,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:25,051 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2021-08-27 10:41:25,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 10:41:25,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 16 [2021-08-27 10:41:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:25,064 INFO L225 Difference]: With dead ends: 74 [2021-08-27 10:41:25,065 INFO L226 Difference]: Without dead ends: 73 [2021-08-27 10:41:25,065 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:25,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-08-27 10:41:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-08-27 10:41:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.3) internal successors, (65), 56 states have internal predecessors, (65), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2021-08-27 10:41:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2021-08-27 10:41:25,075 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 16 [2021-08-27 10:41:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:25,075 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2021-08-27 10:41:25,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2021-08-27 10:41:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2021-08-27 10:41:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 10:41:25,076 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:25,076 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:25,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 10:41:25,077 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:25,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1152696420, now seen corresponding path program 1 times [2021-08-27 10:41:25,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:25,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083333104] [2021-08-27 10:41:25,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:25,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 10:41:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 10:41:25,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:25,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083333104] [2021-08-27 10:41:25,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083333104] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:25,149 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:25,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 10:41:25,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4986690] [2021-08-27 10:41:25,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 10:41:25,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:25,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 10:41:25,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 10:41:25,151 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 10:41:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:25,165 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2021-08-27 10:41:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 10:41:25,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 10:41:25,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:25,181 INFO L225 Difference]: With dead ends: 94 [2021-08-27 10:41:25,181 INFO L226 Difference]: Without dead ends: 93 [2021-08-27 10:41:25,182 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 10:41:25,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-27 10:41:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2021-08-27 10:41:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 60 states have internal predecessors, (71), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2021-08-27 10:41:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2021-08-27 10:41:25,189 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 17 [2021-08-27 10:41:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:25,190 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2021-08-27 10:41:25,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 10:41:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2021-08-27 10:41:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 10:41:25,191 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:25,191 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:25,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 10:41:25,191 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:25,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1079409517, now seen corresponding path program 1 times [2021-08-27 10:41:25,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:25,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134712994] [2021-08-27 10:41:25,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:25,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:25,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:25,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134712994] [2021-08-27 10:41:25,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134712994] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:25,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:25,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 10:41:25,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461123304] [2021-08-27 10:41:25,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 10:41:25,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:25,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 10:41:25,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 10:41:25,261 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 10:41:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:25,308 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2021-08-27 10:41:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 10:41:25,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 10:41:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:25,310 INFO L225 Difference]: With dead ends: 125 [2021-08-27 10:41:25,310 INFO L226 Difference]: Without dead ends: 75 [2021-08-27 10:41:25,311 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 10:41:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-08-27 10:41:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2021-08-27 10:41:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.3) internal successors, (65), 56 states have internal predecessors, (65), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2021-08-27 10:41:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2021-08-27 10:41:25,318 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2021-08-27 10:41:25,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:25,318 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2021-08-27 10:41:25,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 10:41:25,318 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2021-08-27 10:41:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 10:41:25,319 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:25,319 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:25,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 10:41:25,319 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:25,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:25,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1643853139, now seen corresponding path program 1 times [2021-08-27 10:41:25,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:25,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600977701] [2021-08-27 10:41:25,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:25,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 10:41:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 10:41:25,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:25,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600977701] [2021-08-27 10:41:25,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600977701] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:25,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:25,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 10:41:25,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750087417] [2021-08-27 10:41:25,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 10:41:25,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:25,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 10:41:25,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 10:41:25,390 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-08-27 10:41:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:25,455 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2021-08-27 10:41:25,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 10:41:25,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 21 [2021-08-27 10:41:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:25,456 INFO L225 Difference]: With dead ends: 149 [2021-08-27 10:41:25,456 INFO L226 Difference]: Without dead ends: 91 [2021-08-27 10:41:25,458 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.0ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 10:41:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-08-27 10:41:25,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2021-08-27 10:41:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.2830188679245282) 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, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2021-08-27 10:41:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2021-08-27 10:41:25,469 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 21 [2021-08-27 10:41:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:25,470 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2021-08-27 10:41:25,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-08-27 10:41:25,484 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2021-08-27 10:41:25,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 10:41:25,485 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:25,485 INFO L512 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:25,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 10:41:25,485 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:25,486 INFO L82 PathProgramCache]: Analyzing trace with hash 883505486, now seen corresponding path program 1 times [2021-08-27 10:41:25,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:25,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79569496] [2021-08-27 10:41:25,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:25,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 10:41:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-08-27 10:41:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-27 10:41:25,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:25,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79569496] [2021-08-27 10:41:25,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79569496] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:25,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:25,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 10:41:25,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922910974] [2021-08-27 10:41:25,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 10:41:25,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:25,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 10:41:25,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 10:41:25,546 INFO L87 Difference]: Start difference. First operand 79 states and 99 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, (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) [2021-08-27 10:41:25,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:25,605 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2021-08-27 10:41:25,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 10:41:25,605 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, (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 27 [2021-08-27 10:41:25,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:25,606 INFO L225 Difference]: With dead ends: 158 [2021-08-27 10:41:25,606 INFO L226 Difference]: Without dead ends: 95 [2021-08-27 10:41:25,607 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 31.7ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-27 10:41:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-27 10:41:25,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2021-08-27 10:41:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 66 states have internal predecessors, (73), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2021-08-27 10:41:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2021-08-27 10:41:25,633 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 27 [2021-08-27 10:41:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:25,634 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2021-08-27 10:41:25,634 INFO L471 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, (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) [2021-08-27 10:41:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2021-08-27 10:41:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 10:41:25,635 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:25,635 INFO L512 BasicCegarLoop]: 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] [2021-08-27 10:41:25,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 10:41:25,635 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:25,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:25,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1291302577, now seen corresponding path program 1 times [2021-08-27 10:41:25,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:25,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280834940] [2021-08-27 10:41:25,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:25,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-08-27 10:41:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-08-27 10:41:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-27 10:41:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,681 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 10:41:25,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:25,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280834940] [2021-08-27 10:41:25,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280834940] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:25,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:25,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 10:41:25,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975474821] [2021-08-27 10:41:25,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 10:41:25,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:25,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 10:41:25,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 10:41:25,683 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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) [2021-08-27 10:41:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:25,703 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2021-08-27 10:41:25,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 10:41:25,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 35 [2021-08-27 10:41:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:25,705 INFO L225 Difference]: With dead ends: 94 [2021-08-27 10:41:25,705 INFO L226 Difference]: Without dead ends: 93 [2021-08-27 10:41:25,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 10:41:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-27 10:41:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-08-27 10:41:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 68 states have internal predecessors, (77), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2021-08-27 10:41:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2021-08-27 10:41:25,724 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 35 [2021-08-27 10:41:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:25,724 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2021-08-27 10:41:25,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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) [2021-08-27 10:41:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2021-08-27 10:41:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 10:41:25,725 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:25,725 INFO L512 BasicCegarLoop]: 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] [2021-08-27 10:41:25,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 10:41:25,726 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:25,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:25,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1375674171, now seen corresponding path program 1 times [2021-08-27 10:41:25,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:25,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263931992] [2021-08-27 10:41:25,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:25,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-08-27 10:41:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-08-27 10:41:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-27 10:41:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-27 10:41:25,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:25,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263931992] [2021-08-27 10:41:25,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263931992] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:25,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:25,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 10:41:25,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98603712] [2021-08-27 10:41:25,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 10:41:25,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:25,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 10:41:25,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:25,766 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2021-08-27 10:41:25,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:25,779 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2021-08-27 10:41:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 10:41:25,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 36 [2021-08-27 10:41:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:25,780 INFO L225 Difference]: With dead ends: 91 [2021-08-27 10:41:25,791 INFO L226 Difference]: Without dead ends: 90 [2021-08-27 10:41:25,792 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-08-27 10:41:25,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-08-27 10:41:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 67 states have internal predecessors, (75), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2021-08-27 10:41:25,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2021-08-27 10:41:25,797 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 36 [2021-08-27 10:41:25,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:25,797 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2021-08-27 10:41:25,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2021-08-27 10:41:25,797 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2021-08-27 10:41:25,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 10:41:25,798 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:25,798 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:25,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 10:41:25,799 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:25,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:25,799 INFO L82 PathProgramCache]: Analyzing trace with hash 930510463, now seen corresponding path program 1 times [2021-08-27 10:41:25,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:25,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005164706] [2021-08-27 10:41:25,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:25,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 10:41:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 10:41:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-27 10:41:25,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:25,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005164706] [2021-08-27 10:41:25,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005164706] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:25,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:25,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 10:41:25,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725874792] [2021-08-27 10:41:25,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 10:41:25,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:25,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 10:41:25,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 10:41:25,892 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) [2021-08-27 10:41:25,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:25,923 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2021-08-27 10:41:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 10:41:25,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 36 [2021-08-27 10:41:25,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:25,924 INFO L225 Difference]: With dead ends: 90 [2021-08-27 10:41:25,924 INFO L226 Difference]: Without dead ends: 89 [2021-08-27 10:41:25,924 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 10:41:25,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-27 10:41:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-08-27 10:41:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 66 states have internal predecessors, (73), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2021-08-27 10:41:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2021-08-27 10:41:25,928 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 36 [2021-08-27 10:41:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:25,929 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2021-08-27 10:41:25,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) [2021-08-27 10:41:25,929 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2021-08-27 10:41:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 10:41:25,930 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:25,930 INFO L512 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:25,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 10:41:25,930 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:25,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:25,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1111626321, now seen corresponding path program 1 times [2021-08-27 10:41:25,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:25,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234869739] [2021-08-27 10:41:25,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:25,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-08-27 10:41:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 10:41:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 10:41:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-08-27 10:41:25,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:25,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234869739] [2021-08-27 10:41:25,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234869739] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:25,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:25,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 10:41:25,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997781397] [2021-08-27 10:41:25,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 10:41:25,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:25,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 10:41:25,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 10:41:25,996 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) [2021-08-27 10:41:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:26,022 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2021-08-27 10:41:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 10:41:26,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 46 [2021-08-27 10:41:26,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:26,024 INFO L225 Difference]: With dead ends: 99 [2021-08-27 10:41:26,024 INFO L226 Difference]: Without dead ends: 98 [2021-08-27 10:41:26,024 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-27 10:41:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-27 10:41:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2021-08-27 10:41:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 65 states have internal predecessors, (71), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2021-08-27 10:41:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2021-08-27 10:41:26,039 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 46 [2021-08-27 10:41:26,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:26,040 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2021-08-27 10:41:26,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) [2021-08-27 10:41:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2021-08-27 10:41:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-27 10:41:26,040 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:26,040 INFO L512 BasicCegarLoop]: 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] [2021-08-27 10:41:26,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 10:41:26,041 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:26,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:26,041 INFO L82 PathProgramCache]: Analyzing trace with hash 138300185, now seen corresponding path program 1 times [2021-08-27 10:41:26,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:26,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117473778] [2021-08-27 10:41:26,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:26,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:26,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 10:41:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:26,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:26,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 10:41:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:26,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 10:41:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 10:41:26,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:26,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117473778] [2021-08-27 10:41:26,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117473778] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 10:41:26,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637993460] [2021-08-27 10:41:26,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:26,133 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 10:41:26,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 10:41:26,149 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) [2021-08-27 10:41:26,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 10:41:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:26,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 10:41:26,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 10:41:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-27 10:41:26,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637993460] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:26,400 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 10:41:26,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2021-08-27 10:41:26,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125256626] [2021-08-27 10:41:26,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 10:41:26,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:26,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 10:41:26,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-08-27 10:41:26,401 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2021-08-27 10:41:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:26,505 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2021-08-27 10:41:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 10:41:26,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 45 [2021-08-27 10:41:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:26,506 INFO L225 Difference]: With dead ends: 116 [2021-08-27 10:41:26,506 INFO L226 Difference]: Without dead ends: 115 [2021-08-27 10:41:26,506 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 116.0ms TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-08-27 10:41:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-08-27 10:41:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2021-08-27 10:41:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 84 states have internal predecessors, (92), 20 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (28), 22 states have call predecessors, (28), 19 states have call successors, (28) [2021-08-27 10:41:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2021-08-27 10:41:26,511 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 45 [2021-08-27 10:41:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:26,511 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2021-08-27 10:41:26,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2021-08-27 10:41:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2021-08-27 10:41:26,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-27 10:41:26,512 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:26,512 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:26,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 10:41:26,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-27 10:41:26,729 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:26,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:26,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1156205799, now seen corresponding path program 1 times [2021-08-27 10:41:26,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:26,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40524367] [2021-08-27 10:41:26,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:26,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:26,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:26,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:26,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 10:41:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:26,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 10:41:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-27 10:41:26,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:26,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40524367] [2021-08-27 10:41:26,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40524367] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 10:41:26,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997609522] [2021-08-27 10:41:26,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:26,791 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 10:41:26,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 10:41:26,792 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) [2021-08-27 10:41:26,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 10:41:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:26,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 10:41:26,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 10:41:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-27 10:41:26,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997609522] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 10:41:26,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 10:41:26,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-08-27 10:41:26,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194005506] [2021-08-27 10:41:26,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 10:41:26,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:26,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 10:41:26,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-27 10:41:26,969 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 10:41:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:27,020 INFO L93 Difference]: Finished difference Result 224 states and 282 transitions. [2021-08-27 10:41:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 10:41:27,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-08-27 10:41:27,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:27,023 INFO L225 Difference]: With dead ends: 224 [2021-08-27 10:41:27,023 INFO L226 Difference]: Without dead ends: 145 [2021-08-27 10:41:27,024 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.2ms TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-27 10:41:27,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-08-27 10:41:27,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2021-08-27 10:41:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 94 states have (on average 1.1170212765957446) internal successors, (105), 99 states have internal predecessors, (105), 22 states have call successors, (22), 8 states have call predecessors, (22), 12 states have return successors, (37), 24 states have call predecessors, (37), 21 states have call successors, (37) [2021-08-27 10:41:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2021-08-27 10:41:27,032 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 43 [2021-08-27 10:41:27,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:27,032 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2021-08-27 10:41:27,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 10:41:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2021-08-27 10:41:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-27 10:41:27,034 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:27,034 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:27,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 10:41:27,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-08-27 10:41:27,252 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1154921966, now seen corresponding path program 1 times [2021-08-27 10:41:27,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:27,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406531741] [2021-08-27 10:41:27,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:27,253 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 10:41:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 10:41:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 10:41:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-27 10:41:27,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:27,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406531741] [2021-08-27 10:41:27,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406531741] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:27,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:27,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 10:41:27,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301751540] [2021-08-27 10:41:27,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 10:41:27,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:27,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 10:41:27,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:27,303 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 10:41:27,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:27,310 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2021-08-27 10:41:27,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 10:41:27,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2021-08-27 10:41:27,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:27,311 INFO L225 Difference]: With dead ends: 132 [2021-08-27 10:41:27,311 INFO L226 Difference]: Without dead ends: 131 [2021-08-27 10:41:27,312 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-08-27 10:41:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-08-27 10:41:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 98 states have internal predecessors, (103), 22 states have call successors, (22), 8 states have call predecessors, (22), 12 states have return successors, (37), 24 states have call predecessors, (37), 21 states have call successors, (37) [2021-08-27 10:41:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2021-08-27 10:41:27,317 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 43 [2021-08-27 10:41:27,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:27,317 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2021-08-27 10:41:27,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 10:41:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2021-08-27 10:41:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 10:41:27,318 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:27,318 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:27,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 10:41:27,318 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:27,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842648, now seen corresponding path program 1 times [2021-08-27 10:41:27,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:27,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218831684] [2021-08-27 10:41:27,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:27,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 10:41:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 10:41:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 10:41:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-27 10:41:27,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:27,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218831684] [2021-08-27 10:41:27,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218831684] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:27,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:27,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 10:41:27,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832047306] [2021-08-27 10:41:27,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 10:41:27,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:27,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 10:41:27,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 10:41:27,346 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 10:41:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:27,355 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2021-08-27 10:41:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 10:41:27,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2021-08-27 10:41:27,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:27,356 INFO L225 Difference]: With dead ends: 140 [2021-08-27 10:41:27,356 INFO L226 Difference]: Without dead ends: 132 [2021-08-27 10:41:27,357 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 10:41:27,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-08-27 10:41:27,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-08-27 10:41:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 95 states have (on average 1.0947368421052632) internal successors, (104), 99 states have internal predecessors, (104), 21 states have call successors, (21), 8 states have call predecessors, (21), 13 states have return successors, (36), 24 states have call predecessors, (36), 20 states have call successors, (36) [2021-08-27 10:41:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2021-08-27 10:41:27,362 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 44 [2021-08-27 10:41:27,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:27,362 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2021-08-27 10:41:27,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 10:41:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2021-08-27 10:41:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-27 10:41:27,363 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:27,363 INFO L512 BasicCegarLoop]: 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] [2021-08-27 10:41:27,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 10:41:27,363 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-08-27 10:41:27,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:27,363 INFO L82 PathProgramCache]: Analyzing trace with hash -920789439, now seen corresponding path program 2 times [2021-08-27 10:41:27,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:27,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402322356] [2021-08-27 10:41:27,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:27,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-08-27 10:41:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 10:41:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 10:41:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-08-27 10:41:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 10:41:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 10:41:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 71 proven. 28 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-08-27 10:41:27,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:27,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402322356] [2021-08-27 10:41:27,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402322356] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 10:41:27,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944694204] [2021-08-27 10:41:27,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 10:41:27,487 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 10:41:27,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 10:41:27,497 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) [2021-08-27 10:41:27,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 10:41:27,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 10:41:27,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 10:41:27,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 10:41:27,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 10:41:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 71 proven. 28 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-08-27 10:41:27,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944694204] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 10:41:27,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 10:41:27,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2021-08-27 10:41:27,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768897788] [2021-08-27 10:41:27,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 10:41:27,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:27,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 10:41:27,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-08-27 10:41:27,941 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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) [2021-08-27 10:41:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:28,040 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions. [2021-08-27 10:41:28,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 10:41:28,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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 80 [2021-08-27 10:41:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:28,042 INFO L225 Difference]: With dead ends: 173 [2021-08-27 10:41:28,042 INFO L226 Difference]: Without dead ends: 0 [2021-08-27 10:41:28,043 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 94.1ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-08-27 10:41:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-27 10:41:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-27 10:41:28,043 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) [2021-08-27 10:41:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 10:41:28,043 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2021-08-27 10:41:28,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:28,043 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 10:41:28,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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) [2021-08-27 10:41:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-27 10:41:28,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-27 10:41:28,045 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:28,046 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:28,046 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:28,046 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:28,046 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:28,046 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:28,046 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:28,046 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:28,047 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:28,047 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:28,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 10:41:28,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-27 10:41:28,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-27 10:41:28,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,273 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,297 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,297 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,303 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,303 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,420 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:28,626 INFO L857 garLoopResultBuilder]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,626 INFO L857 garLoopResultBuilder]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2021-08-27 10:41:28,626 INFO L857 garLoopResultBuilder]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,626 INFO L857 garLoopResultBuilder]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2021-08-27 10:41:28,626 INFO L857 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,626 INFO L860 garLoopResultBuilder]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2021-08-27 10:41:28,626 INFO L857 garLoopResultBuilder]: For program point L14-1(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,627 INFO L857 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2021-08-27 10:41:28,627 INFO L853 garLoopResultBuilder]: At program point L14-2(line 14) the Hoare annotation is: (and (or (= |rec1_#in~i| rec1_~i) (not (<= |rec1_#in~i| 2147483647))) (or (not (<= |rec1_#in~i| 2147483646)) (<= 1 rec1_~i))) [2021-08-27 10:41:28,627 INFO L857 garLoopResultBuilder]: For program point L14-3(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,627 INFO L857 garLoopResultBuilder]: For program point L14-4(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,627 INFO L857 garLoopResultBuilder]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,627 INFO L857 garLoopResultBuilder]: For program point L14-5(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,627 INFO L853 garLoopResultBuilder]: At program point L14-6(line 14) the Hoare annotation is: (and (or (and (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) (not (<= |rec1_#in~i| 2147483647))) (or (not (<= |rec1_#in~i| 2147483646)) (<= 1 rec1_~i))) [2021-08-27 10:41:28,627 INFO L857 garLoopResultBuilder]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,628 INFO L857 garLoopResultBuilder]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,628 INFO L857 garLoopResultBuilder]: For program point L14-7(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,628 INFO L857 garLoopResultBuilder]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,628 INFO L853 garLoopResultBuilder]: At program point L14-8(line 14) the Hoare annotation is: (or (not (<= |rec1_#in~i| 2147483647)) (and (<= |rec1_#t~ret1| 0) (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i))) [2021-08-27 10:41:28,628 INFO L857 garLoopResultBuilder]: For program point L14-9(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,628 INFO L857 garLoopResultBuilder]: For program point L14-10(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,628 INFO L857 garLoopResultBuilder]: For program point L14-11(line 14) no Hoare annotation was computed. [2021-08-27 10:41:28,628 INFO L857 garLoopResultBuilder]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2021-08-27 10:41:28,628 INFO L857 garLoopResultBuilder]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2021-08-27 10:41:28,629 INFO L857 garLoopResultBuilder]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2021-08-27 10:41:28,629 INFO L853 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (and (not (<= |rec2_#in~j| 0)) (or (not (<= |rec2_#in~j| 2147483647)) (and (<= 1 rec2_~j) (<= rec2_~j 2147483647)))) [2021-08-27 10:41:28,629 INFO L857 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2021-08-27 10:41:28,629 INFO L857 garLoopResultBuilder]: For program point L18(lines 18 19) no Hoare annotation was computed. [2021-08-27 10:41:28,629 INFO L857 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2021-08-27 10:41:28,629 INFO L857 garLoopResultBuilder]: For program point L20-3(line 20) no Hoare annotation was computed. [2021-08-27 10:41:28,629 INFO L853 garLoopResultBuilder]: At program point L20-4(line 20) the Hoare annotation is: (and (or (not (<= |rec2_#in~j| 2147483647)) (and (<= |rec2_#t~ret3| 1) (<= 1 |rec2_#t~ret3|) (<= 1 rec2_~j) (<= rec2_~j 2147483647))) (not (<= |rec2_#in~j| 0))) [2021-08-27 10:41:28,629 INFO L857 garLoopResultBuilder]: For program point L20-5(line 20) no Hoare annotation was computed. [2021-08-27 10:41:28,629 INFO L857 garLoopResultBuilder]: For program point L20-6(line 20) no Hoare annotation was computed. [2021-08-27 10:41:28,630 INFO L857 garLoopResultBuilder]: For program point L20-7(line 20) no Hoare annotation was computed. [2021-08-27 10:41:28,630 INFO L860 garLoopResultBuilder]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2021-08-27 10:41:28,630 INFO L857 garLoopResultBuilder]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2021-08-27 10:41:28,630 INFO L857 garLoopResultBuilder]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2021-08-27 10:41:28,630 INFO L857 garLoopResultBuilder]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2021-08-27 10:41:28,630 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-27 10:41:28,630 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-27 10:41:28,630 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-27 10:41:28,630 INFO L853 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2021-08-27 10:41:28,631 INFO L857 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2021-08-27 10:41:28,631 INFO L857 garLoopResultBuilder]: For program point L23(lines 23 26) no Hoare annotation was computed. [2021-08-27 10:41:28,634 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 10:41:28,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:41:28 BoogieIcfgContainer [2021-08-27 10:41:28,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 10:41:28,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 10:41:28,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 10:41:28,636 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 10:41:28,637 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:41:24" (3/4) ... [2021-08-27 10:41:28,638 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-27 10:41:28,642 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2021-08-27 10:41:28,642 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2021-08-27 10:41:28,645 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-08-27 10:41:28,645 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-27 10:41:28,663 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 10:41:28,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 10:41:28,665 INFO L168 Benchmark]: Toolchain (without parser) took 4878.94 ms. Allocated memory was 62.9 MB in the beginning and 113.2 MB in the end (delta: 50.3 MB). Free memory was 43.3 MB in the beginning and 56.0 MB in the end (delta: -12.8 MB). Peak memory consumption was 37.1 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:28,665 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 62.9 MB. Free memory is still 43.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 10:41:28,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 102.02 ms. Allocated memory is still 62.9 MB. Free memory was 43.0 MB in the beginning and 34.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:28,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.80 ms. Allocated memory is still 62.9 MB. Free memory was 34.5 MB in the beginning and 46.7 MB in the end (delta: -12.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:28,665 INFO L168 Benchmark]: Boogie Preprocessor took 18.32 ms. Allocated memory is still 62.9 MB. Free memory was 46.7 MB in the beginning and 45.9 MB in the end (delta: 787.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 10:41:28,666 INFO L168 Benchmark]: RCFGBuilder took 308.90 ms. Allocated memory is still 62.9 MB. Free memory was 45.9 MB in the beginning and 33.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:28,666 INFO L168 Benchmark]: TraceAbstraction took 4372.22 ms. Allocated memory was 62.9 MB in the beginning and 113.2 MB in the end (delta: 50.3 MB). Free memory was 32.8 MB in the beginning and 58.1 MB in the end (delta: -25.3 MB). Peak memory consumption was 56.0 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:28,666 INFO L168 Benchmark]: Witness Printer took 27.56 ms. Allocated memory is still 113.2 MB. Free memory was 58.1 MB in the beginning and 56.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:28,667 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.14 ms. Allocated memory is still 62.9 MB. Free memory is still 43.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 102.02 ms. Allocated memory is still 62.9 MB. Free memory was 43.0 MB in the beginning and 34.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.80 ms. Allocated memory is still 62.9 MB. Free memory was 34.5 MB in the beginning and 46.7 MB in the end (delta: -12.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 18.32 ms. Allocated memory is still 62.9 MB. Free memory was 46.7 MB in the beginning and 45.9 MB in the end (delta: 787.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 308.90 ms. Allocated memory is still 62.9 MB. Free memory was 45.9 MB in the beginning and 33.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4372.22 ms. Allocated memory was 62.9 MB in the beginning and 113.2 MB in the end (delta: 50.3 MB). Free memory was 32.8 MB in the beginning and 58.1 MB in the end (delta: -25.3 MB). Peak memory consumption was 56.0 MB. Max. memory is 16.1 GB. * Witness Printer took 27.56 ms. Allocated memory is still 113.2 MB. Free memory was 58.1 MB in the beginning and 56.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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, 44 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 4323.2ms, OverallIterations: 18, TraceHistogramMax: 11, EmptinessCheckTime: 17.5ms, AutomataDifference: 896.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 361.6ms, InitialAbstractionConstructionTime: 10.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 683 SDtfs, 226 SDslu, 1577 SDs, 0 SdLazy, 534 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 344.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 441.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=15, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 200.4ms AutomataMinimizationTime, 18 MinimizatonAttempts, 89 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 8 LocationsWithAnnotation, 241 PreInvPairs, 259 NumberOfFragments, 101 HoareAnnotationTreeSize, 241 FomulaSimplifications, 1035 FormulaSimplificationTreeSizeReduction, 184.4ms HoareSimplificationTime, 8 FomulaSimplificationsInter, 259 FormulaSimplificationTreeSizeReductionInter, 160.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 23.4ms SsaConstructionTime, 229.8ms SatisfiabilityAnalysisTime, 1450.9ms InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 695 ConstructedInterpolants, 0 QuantifiedInterpolants, 1067 SizeOfPredicates, 3 NumberOfNonLiveVariables, 351 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 749/811 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! [2021-08-27 10:41:28,692 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...