./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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/recursive-simple/fibo_2calls_8-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 14:49:33,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 14:49:33,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 14:49:33,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 14:49:33,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 14:49:33,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 14:49:33,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 14:49:33,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 14:49:33,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 14:49:33,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 14:49:33,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 14:49:33,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 14:49:33,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 14:49:33,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 14:49:33,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 14:49:33,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 14:49:33,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 14:49:33,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 14:49:33,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 14:49:33,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 14:49:33,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 14:49:33,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 14:49:33,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 14:49:33,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 14:49:33,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 14:49:33,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 14:49:33,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 14:49:33,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 14:49:33,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 14:49:33,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 14:49:33,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 14:49:33,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 14:49:33,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 14:49:33,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 14:49:33,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 14:49:33,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 14:49:33,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 14:49:33,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 14:49:33,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 14:49:33,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 14:49:33,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 14:49:33,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 14:49:33,575 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 14:49:33,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 14:49:33,575 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 14:49:33,578 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 14:49:33,579 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 14:49:33,579 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 14:49:33,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 14:49:33,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 14:49:33,580 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 14:49:33,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 14:49:33,580 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 14:49:33,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 14:49:33,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 14:49:33,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 14:49:33,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 14:49:33,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 14:49:33,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 14:49:33,582 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 14:49:33,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 14:49:33,582 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 14:49:33,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 14:49:33,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 14:49:33,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 14:49:33,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 14:49:33,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 14:49:33,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 14:49:33,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 14:49:33,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 14:49:33,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 14:49:33,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 14:49:33,584 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 14:49:33,584 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 14:49:33,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 14:49:33,585 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 14:49:33,585 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2021-12-14 14:49:33,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 14:49:33,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 14:49:33,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 14:49:33,787 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 14:49:33,789 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 14:49:33,790 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-12-14 14:49:33,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7866e99/9c1e5e3b888a4b1d9f7c7423f2a1ec89/FLAG22c56f036 [2021-12-14 14:49:34,189 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 14:49:34,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-12-14 14:49:34,194 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7866e99/9c1e5e3b888a4b1d9f7c7423f2a1ec89/FLAG22c56f036 [2021-12-14 14:49:34,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7866e99/9c1e5e3b888a4b1d9f7c7423f2a1ec89 [2021-12-14 14:49:34,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 14:49:34,210 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 14:49:34,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 14:49:34,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 14:49:34,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 14:49:34,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:49:34" (1/1) ... [2021-12-14 14:49:34,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e798df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:34, skipping insertion in model container [2021-12-14 14:49:34,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:49:34" (1/1) ... [2021-12-14 14:49:34,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 14:49:34,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 14:49:34,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2021-12-14 14:49:34,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 14:49:34,367 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 14:49:34,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2021-12-14 14:49:34,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 14:49:34,393 INFO L208 MainTranslator]: Completed translation [2021-12-14 14:49:34,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:34 WrapperNode [2021-12-14 14:49:34,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 14:49:34,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 14:49:34,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 14:49:34,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 14:49:34,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:34" (1/1) ... [2021-12-14 14:49:34,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:34" (1/1) ... [2021-12-14 14:49:34,418 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2021-12-14 14:49:34,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 14:49:34,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 14:49:34,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 14:49:34,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 14:49:34,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:34" (1/1) ... [2021-12-14 14:49:34,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:34" (1/1) ... [2021-12-14 14:49:34,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:34" (1/1) ... [2021-12-14 14:49:34,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:34" (1/1) ... [2021-12-14 14:49:34,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:34" (1/1) ... [2021-12-14 14:49:34,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:34" (1/1) ... [2021-12-14 14:49:34,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:34" (1/1) ... [2021-12-14 14:49:34,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 14:49:34,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 14:49:34,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 14:49:34,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 14:49:34,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:34" (1/1) ... [2021-12-14 14:49:34,462 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 14:49:34,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:34,500 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-12-14 14:49:34,547 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-12-14 14:49:34,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 14:49:34,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 14:49:34,563 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-12-14 14:49:34,563 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-12-14 14:49:34,563 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-12-14 14:49:34,564 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-12-14 14:49:34,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 14:49:34,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 14:49:34,603 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 14:49:34,604 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 14:49:34,705 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 14:49:34,709 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 14:49:34,709 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 14:49:34,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:49:34 BoogieIcfgContainer [2021-12-14 14:49:34,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 14:49:34,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 14:49:34,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 14:49:34,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 14:49:34,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:49:34" (1/3) ... [2021-12-14 14:49:34,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1482cb1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:49:34, skipping insertion in model container [2021-12-14 14:49:34,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:34" (2/3) ... [2021-12-14 14:49:34,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1482cb1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:49:34, skipping insertion in model container [2021-12-14 14:49:34,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:49:34" (3/3) ... [2021-12-14 14:49:34,718 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2021-12-14 14:49:34,721 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 14:49:34,721 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 14:49:34,748 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 14:49:34,755 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, 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-12-14 14:49:34,755 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 14:49:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 14:49:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 14:49:34,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:34,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:34,773 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2021-12-14 14:49:34,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:34,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865492823] [2021-12-14 14:49:34,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:34,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:49:34,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:34,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865492823] [2021-12-14 14:49:34,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865492823] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:49:34,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:49:34,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 14:49:34,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294393281] [2021-12-14 14:49:34,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:49:34,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 14:49:34,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:34,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 14:49:34,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 14:49:34,983 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 14:49:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:35,052 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-14 14:49:35,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 14:49:35,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-12-14 14:49:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:35,059 INFO L225 Difference]: With dead ends: 43 [2021-12-14 14:49:35,059 INFO L226 Difference]: Without dead ends: 27 [2021-12-14 14:49:35,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 14:49:35,064 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:35,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:49:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-14 14:49:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-14 14:49:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 14:49:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-14 14:49:35,094 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2021-12-14 14:49:35,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:35,095 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-14 14:49:35,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 14:49:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-14 14:49:35,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 14:49:35,096 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:35,097 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:35,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 14:49:35,097 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:35,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:35,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2021-12-14 14:49:35,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:35,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666600450] [2021-12-14 14:49:35,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:35,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:35,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:49:35,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:35,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666600450] [2021-12-14 14:49:35,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666600450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:49:35,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:49:35,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 14:49:35,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027467817] [2021-12-14 14:49:35,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:49:35,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 14:49:35,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:35,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 14:49:35,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 14:49:35,194 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 14:49:35,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:35,207 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2021-12-14 14:49:35,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 14:49:35,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-12-14 14:49:35,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:35,209 INFO L225 Difference]: With dead ends: 33 [2021-12-14 14:49:35,209 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 14:49:35,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 14:49:35,210 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:35,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:49:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 14:49:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-14 14:49:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 14:49:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-14 14:49:35,216 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2021-12-14 14:49:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:35,216 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-14 14:49:35,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 14:49:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-14 14:49:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 14:49:35,218 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:35,218 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:35,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 14:49:35,218 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:35,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2021-12-14 14:49:35,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:35,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359809269] [2021-12-14 14:49:35,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:35,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:35,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:35,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:35,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 14:49:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:49:35,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:35,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359809269] [2021-12-14 14:49:35,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359809269] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:35,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884507492] [2021-12-14 14:49:35,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:35,300 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:35,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:35,302 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-12-14 14:49:35,303 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-12-14 14:49:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:35,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 14:49:35,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:49:35,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:49:35,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884507492] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:35,619 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:35,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2021-12-14 14:49:35,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852951511] [2021-12-14 14:49:35,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:35,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 14:49:35,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:35,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 14:49:35,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-14 14:49:35,626 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-14 14:49:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:35,735 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2021-12-14 14:49:35,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 14:49:35,736 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2021-12-14 14:49:35,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:35,736 INFO L225 Difference]: With dead ends: 55 [2021-12-14 14:49:35,737 INFO L226 Difference]: Without dead ends: 31 [2021-12-14 14:49:35,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-12-14 14:49:35,738 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:35,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 141 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:49:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-14 14:49:35,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-12-14 14:49:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-14 14:49:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-12-14 14:49:35,743 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2021-12-14 14:49:35,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:35,744 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-12-14 14:49:35,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-14 14:49:35,744 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-12-14 14:49:35,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 14:49:35,745 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:35,745 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:35,764 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-12-14 14:49:35,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:35,960 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:35,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:35,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2021-12-14 14:49:35,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:35,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433518405] [2021-12-14 14:49:35,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:35,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:35,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:49:36,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:36,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433518405] [2021-12-14 14:49:36,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433518405] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:36,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564046893] [2021-12-14 14:49:36,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:36,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:36,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:36,033 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-12-14 14:49:36,034 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-12-14 14:49:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 14:49:36,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:49:36,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:49:36,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564046893] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:36,256 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:36,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2021-12-14 14:49:36,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969282192] [2021-12-14 14:49:36,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:36,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 14:49:36,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:36,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 14:49:36,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-14 14:49:36,259 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-14 14:49:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:36,346 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2021-12-14 14:49:36,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 14:49:36,346 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2021-12-14 14:49:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:36,348 INFO L225 Difference]: With dead ends: 51 [2021-12-14 14:49:36,348 INFO L226 Difference]: Without dead ends: 47 [2021-12-14 14:49:36,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-14 14:49:36,349 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:36,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 120 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:49:36,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-14 14:49:36,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-12-14 14:49:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2021-12-14 14:49:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2021-12-14 14:49:36,356 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2021-12-14 14:49:36,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:36,356 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2021-12-14 14:49:36,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-14 14:49:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2021-12-14 14:49:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 14:49:36,358 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:36,358 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:36,374 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-12-14 14:49:36,574 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,SelfDestructingSolverStorable3 [2021-12-14 14:49:36,574 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:36,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2021-12-14 14:49:36,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:36,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190740758] [2021-12-14 14:49:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:36,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 14:49:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 14:49:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 14:49:36,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:36,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190740758] [2021-12-14 14:49:36,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190740758] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:36,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683951195] [2021-12-14 14:49:36,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:36,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:36,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:36,634 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-12-14 14:49:36,635 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-12-14 14:49:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 14:49:36,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 14:49:36,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 14:49:37,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683951195] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:37,023 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:37,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2021-12-14 14:49:37,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343787347] [2021-12-14 14:49:37,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:37,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 14:49:37,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:37,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 14:49:37,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-12-14 14:49:37,024 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-14 14:49:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:37,180 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2021-12-14 14:49:37,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 14:49:37,181 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2021-12-14 14:49:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:37,182 INFO L225 Difference]: With dead ends: 105 [2021-12-14 14:49:37,182 INFO L226 Difference]: Without dead ends: 63 [2021-12-14 14:49:37,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-12-14 14:49:37,183 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:37,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 118 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:49:37,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-14 14:49:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-14 14:49:37,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2021-12-14 14:49:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2021-12-14 14:49:37,191 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2021-12-14 14:49:37,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:37,191 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2021-12-14 14:49:37,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-14 14:49:37,191 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2021-12-14 14:49:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 14:49:37,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:37,193 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:37,209 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-12-14 14:49:37,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:37,403 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:37,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2021-12-14 14:49:37,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:37,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900571215] [2021-12-14 14:49:37,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:37,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 14:49:37,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:37,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900571215] [2021-12-14 14:49:37,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900571215] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:37,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717697804] [2021-12-14 14:49:37,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:37,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:37,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:37,508 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:49:37,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 14:49:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 14:49:37,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 14:49:37,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 14:49:37,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717697804] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:37,869 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:37,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2021-12-14 14:49:37,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151989724] [2021-12-14 14:49:37,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:37,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 14:49:37,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:37,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 14:49:37,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-12-14 14:49:37,871 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-14 14:49:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:38,142 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2021-12-14 14:49:38,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 14:49:38,142 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2021-12-14 14:49:38,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:38,144 INFO L225 Difference]: With dead ends: 177 [2021-12-14 14:49:38,144 INFO L226 Difference]: Without dead ends: 117 [2021-12-14 14:49:38,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2021-12-14 14:49:38,146 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:38,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 276 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:49:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-14 14:49:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2021-12-14 14:49:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2021-12-14 14:49:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2021-12-14 14:49:38,159 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2021-12-14 14:49:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:38,159 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2021-12-14 14:49:38,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-14 14:49:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2021-12-14 14:49:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 14:49:38,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:38,162 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:38,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:38,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:38,381 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:38,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:38,381 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2021-12-14 14:49:38,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:38,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126504263] [2021-12-14 14:49:38,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:38,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:38,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:38,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:38,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:38,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:38,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:38,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:38,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 14:49:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 14:49:38,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:38,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126504263] [2021-12-14 14:49:38,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126504263] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:38,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858544622] [2021-12-14 14:49:38,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:38,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:38,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:38,500 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:49:38,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 14:49:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:38,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 14:49:38,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-14 14:49:38,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 14:49:39,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858544622] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:39,063 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:39,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2021-12-14 14:49:39,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966883516] [2021-12-14 14:49:39,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:39,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 14:49:39,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:39,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 14:49:39,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-12-14 14:49:39,065 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-14 14:49:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:39,383 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2021-12-14 14:49:39,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 14:49:39,383 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2021-12-14 14:49:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:39,385 INFO L225 Difference]: With dead ends: 255 [2021-12-14 14:49:39,385 INFO L226 Difference]: Without dead ends: 155 [2021-12-14 14:49:39,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2021-12-14 14:49:39,387 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:39,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 280 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:49:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-14 14:49:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2021-12-14 14:49:39,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2021-12-14 14:49:39,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2021-12-14 14:49:39,400 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2021-12-14 14:49:39,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:39,401 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2021-12-14 14:49:39,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-14 14:49:39,401 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2021-12-14 14:49:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-14 14:49:39,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:39,403 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:39,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:39,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:39,620 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:39,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:39,620 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2021-12-14 14:49:39,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:39,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25950198] [2021-12-14 14:49:39,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:39,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 14:49:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-14 14:49:39,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:39,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25950198] [2021-12-14 14:49:39,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25950198] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:39,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415698106] [2021-12-14 14:49:39,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:39,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:39,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:39,755 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:49:39,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 14:49:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 14:49:39,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-12-14 14:49:39,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-14 14:49:40,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415698106] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:40,596 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:40,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2021-12-14 14:49:40,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76888551] [2021-12-14 14:49:40,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:40,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-14 14:49:40,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:40,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-14 14:49:40,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2021-12-14 14:49:40,598 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2021-12-14 14:49:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:40,958 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2021-12-14 14:49:40,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 14:49:40,959 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) Word has length 93 [2021-12-14 14:49:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:40,960 INFO L225 Difference]: With dead ends: 240 [2021-12-14 14:49:40,960 INFO L226 Difference]: Without dead ends: 107 [2021-12-14 14:49:40,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2021-12-14 14:49:40,962 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 111 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:40,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 270 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:49:40,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-14 14:49:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2021-12-14 14:49:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2021-12-14 14:49:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2021-12-14 14:49:40,970 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2021-12-14 14:49:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:40,970 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2021-12-14 14:49:40,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2021-12-14 14:49:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2021-12-14 14:49:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-12-14 14:49:40,972 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:40,972 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:40,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:41,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:41,188 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:41,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:41,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2021-12-14 14:49:41,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:41,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717178871] [2021-12-14 14:49:41,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:41,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 14:49:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-14 14:49:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 73 proven. 135 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2021-12-14 14:49:41,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:41,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717178871] [2021-12-14 14:49:41,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717178871] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:41,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66095224] [2021-12-14 14:49:41,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:41,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:41,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:41,376 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:49:41,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 14:49:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 14:49:41,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 211 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2021-12-14 14:49:41,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 227 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-12-14 14:49:42,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66095224] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:42,634 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:42,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 26 [2021-12-14 14:49:42,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872939555] [2021-12-14 14:49:42,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:42,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-14 14:49:42,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:42,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-14 14:49:42,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2021-12-14 14:49:42,636 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2021-12-14 14:49:43,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:43,060 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2021-12-14 14:49:43,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-14 14:49:43,061 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) Word has length 148 [2021-12-14 14:49:43,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:43,066 INFO L225 Difference]: With dead ends: 214 [2021-12-14 14:49:43,066 INFO L226 Difference]: Without dead ends: 134 [2021-12-14 14:49:43,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2021-12-14 14:49:43,069 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 108 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:43,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 313 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 14:49:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-14 14:49:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2021-12-14 14:49:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 78 states have internal predecessors, (93), 20 states have call successors, (20), 11 states have call predecessors, (20), 16 states have return successors, (56), 24 states have call predecessors, (56), 20 states have call successors, (56) [2021-12-14 14:49:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2021-12-14 14:49:43,088 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2021-12-14 14:49:43,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:43,088 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2021-12-14 14:49:43,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2021-12-14 14:49:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2021-12-14 14:49:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-12-14 14:49:43,091 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:43,091 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 17, 16, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:43,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:43,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:43,309 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:43,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:43,310 INFO L85 PathProgramCache]: Analyzing trace with hash -399650163, now seen corresponding path program 2 times [2021-12-14 14:49:43,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:43,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200864818] [2021-12-14 14:49:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:43,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 14:49:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-14 14:49:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 14:49:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 169 proven. 360 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2021-12-14 14:49:43,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:43,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200864818] [2021-12-14 14:49:43,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200864818] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:43,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141564278] [2021-12-14 14:49:43,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 14:49:43,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:43,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:43,712 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:49:43,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 14:49:43,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 14:49:43,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:49:43,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-14 14:49:43,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 543 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2021-12-14 14:49:44,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 567 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2021-12-14 14:49:45,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141564278] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:45,790 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:45,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 27 [2021-12-14 14:49:45,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140126342] [2021-12-14 14:49:45,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:45,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-14 14:49:45,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:45,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-14 14:49:45,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2021-12-14 14:49:45,791 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2021-12-14 14:49:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:46,278 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2021-12-14 14:49:46,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-14 14:49:46,278 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) Word has length 271 [2021-12-14 14:49:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:46,280 INFO L225 Difference]: With dead ends: 260 [2021-12-14 14:49:46,280 INFO L226 Difference]: Without dead ends: 155 [2021-12-14 14:49:46,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 605 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2021-12-14 14:49:46,281 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 109 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:46,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 354 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 14:49:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-14 14:49:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2021-12-14 14:49:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 99 states have internal predecessors, (125), 26 states have call successors, (26), 18 states have call predecessors, (26), 17 states have return successors, (73), 27 states have call predecessors, (73), 26 states have call successors, (73) [2021-12-14 14:49:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2021-12-14 14:49:46,288 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 271 [2021-12-14 14:49:46,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:46,288 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2021-12-14 14:49:46,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2021-12-14 14:49:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2021-12-14 14:49:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2021-12-14 14:49:46,292 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:46,292 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 27, 27, 25, 23, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 12, 8, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:46,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-14 14:49:46,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 14:49:46,508 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:46,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1123052726, now seen corresponding path program 3 times [2021-12-14 14:49:46,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:46,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166425229] [2021-12-14 14:49:46,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:46,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 14:49:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-14 14:49:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:46,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-14 14:49:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 264 proven. 626 refuted. 0 times theorem prover too weak. 3539 trivial. 0 not checked. [2021-12-14 14:49:47,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:47,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166425229] [2021-12-14 14:49:47,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166425229] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:47,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558293816] [2021-12-14 14:49:47,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 14:49:47,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:47,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:47,051 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:49:47,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 14:49:47,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-14 14:49:47,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:49:47,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 14:49:47,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 434 proven. 4 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2021-12-14 14:49:47,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 434 proven. 4 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2021-12-14 14:49:48,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558293816] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:48,616 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:48,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2021-12-14 14:49:48,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114521310] [2021-12-14 14:49:48,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:48,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-14 14:49:48,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:48,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 14:49:48,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-12-14 14:49:48,618 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2021-12-14 14:49:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:48,762 INFO L93 Difference]: Finished difference Result 283 states and 457 transitions. [2021-12-14 14:49:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 14:49:48,763 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) Word has length 394 [2021-12-14 14:49:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:48,764 INFO L225 Difference]: With dead ends: 283 [2021-12-14 14:49:48,764 INFO L226 Difference]: Without dead ends: 147 [2021-12-14 14:49:48,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 896 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-12-14 14:49:48,765 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 73 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:48,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 199 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:49:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-14 14:49:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2021-12-14 14:49:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.198019801980198) internal successors, (121), 98 states have internal predecessors, (121), 26 states have call successors, (26), 19 states have call predecessors, (26), 16 states have return successors, (66), 26 states have call predecessors, (66), 26 states have call successors, (66) [2021-12-14 14:49:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2021-12-14 14:49:48,772 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 394 [2021-12-14 14:49:48,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:48,772 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2021-12-14 14:49:48,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2021-12-14 14:49:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2021-12-14 14:49:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2021-12-14 14:49:48,778 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:48,778 INFO L514 BasicCegarLoop]: trace histogram [43, 43, 36, 36, 33, 31, 21, 21, 21, 21, 21, 21, 21, 18, 18, 18, 18, 18, 18, 18, 15, 10, 10, 5, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:48,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:48,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:48,994 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:48,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2090861273, now seen corresponding path program 4 times [2021-12-14 14:49:48,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:48,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160631153] [2021-12-14 14:49:48,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:48,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2021-12-14 14:49:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2021-12-14 14:49:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 1090 proven. 942 refuted. 0 times theorem prover too weak. 6545 trivial. 0 not checked. [2021-12-14 14:49:49,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:49,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160631153] [2021-12-14 14:49:49,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160631153] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:49,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726294393] [2021-12-14 14:49:49,961 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 14:49:49,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:49,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:49,976 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:49:49,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 14:49:50,154 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 14:49:50,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:49:50,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-14 14:49:50,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 490 proven. 1080 refuted. 0 times theorem prover too weak. 7007 trivial. 0 not checked. [2021-12-14 14:49:50,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 492 proven. 1108 refuted. 0 times theorem prover too weak. 6977 trivial. 0 not checked. [2021-12-14 14:49:53,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726294393] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:53,338 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:53,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 19] total 42 [2021-12-14 14:49:53,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632622557] [2021-12-14 14:49:53,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:53,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-14 14:49:53,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:53,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-14 14:49:53,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1485, Unknown=0, NotChecked=0, Total=1722 [2021-12-14 14:49:53,340 INFO L87 Difference]: Start difference. First operand 144 states and 213 transitions. Second operand has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) [2021-12-14 14:49:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:54,206 INFO L93 Difference]: Finished difference Result 355 states and 619 transitions. [2021-12-14 14:49:54,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-14 14:49:54,207 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) Word has length 542 [2021-12-14 14:49:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:54,209 INFO L225 Difference]: With dead ends: 355 [2021-12-14 14:49:54,209 INFO L226 Difference]: Without dead ends: 183 [2021-12-14 14:49:54,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1285 GetRequests, 1222 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=535, Invalid=3371, Unknown=0, NotChecked=0, Total=3906 [2021-12-14 14:49:54,211 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 173 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:54,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 648 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 14:49:54,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-14 14:49:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 155. [2021-12-14 14:49:54,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 109 states have (on average 1.091743119266055) internal successors, (119), 106 states have internal predecessors, (119), 29 states have call successors, (29), 22 states have call predecessors, (29), 16 states have return successors, (42), 26 states have call predecessors, (42), 29 states have call successors, (42) [2021-12-14 14:49:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2021-12-14 14:49:54,218 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 542 [2021-12-14 14:49:54,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:54,218 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2021-12-14 14:49:54,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) [2021-12-14 14:49:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2021-12-14 14:49:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2021-12-14 14:49:54,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:54,221 INFO L514 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:54,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:54,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-14 14:49:54,439 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1387676979, now seen corresponding path program 5 times [2021-12-14 14:49:54,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:54,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142057826] [2021-12-14 14:49:54,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:54,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-14 14:49:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-14 14:49:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:54,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1060 proven. 718 refuted. 0 times theorem prover too weak. 3591 trivial. 0 not checked. [2021-12-14 14:49:55,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:55,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142057826] [2021-12-14 14:49:55,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142057826] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:55,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524509983] [2021-12-14 14:49:55,220 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 14:49:55,221 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:55,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:55,236 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:49:55,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 14:49:55,461 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-12-14 14:49:55,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:49:55,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 14:49:55,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 918 proven. 135 refuted. 0 times theorem prover too weak. 4316 trivial. 0 not checked. [2021-12-14 14:49:55,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 920 proven. 137 refuted. 0 times theorem prover too weak. 4312 trivial. 0 not checked. [2021-12-14 14:49:57,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524509983] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:57,139 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:57,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 15] total 41 [2021-12-14 14:49:57,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383310171] [2021-12-14 14:49:57,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:57,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-14 14:49:57,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:57,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-14 14:49:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2021-12-14 14:49:57,142 INFO L87 Difference]: Start difference. First operand 155 states and 190 transitions. Second operand has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) [2021-12-14 14:49:57,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:57,662 INFO L93 Difference]: Finished difference Result 333 states and 423 transitions. [2021-12-14 14:49:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-14 14:49:57,663 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) Word has length 433 [2021-12-14 14:49:57,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:57,666 INFO L225 Difference]: With dead ends: 333 [2021-12-14 14:49:57,666 INFO L226 Difference]: Without dead ends: 185 [2021-12-14 14:49:57,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 977 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=416, Invalid=2446, Unknown=0, NotChecked=0, Total=2862 [2021-12-14 14:49:57,668 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 132 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:57,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 689 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 14:49:57,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-14 14:49:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2021-12-14 14:49:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.0535714285714286) internal successors, (118), 110 states have internal predecessors, (118), 30 states have call successors, (30), 23 states have call predecessors, (30), 16 states have return successors, (41), 25 states have call predecessors, (41), 30 states have call successors, (41) [2021-12-14 14:49:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2021-12-14 14:49:57,679 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 433 [2021-12-14 14:49:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:57,681 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2021-12-14 14:49:57,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) [2021-12-14 14:49:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2021-12-14 14:49:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-12-14 14:49:57,683 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:57,683 INFO L514 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:57,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:57,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-14 14:49:57,899 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:57,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:57,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1402769443, now seen corresponding path program 6 times [2021-12-14 14:49:57,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:57,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39307373] [2021-12-14 14:49:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:57,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 14:49:57,934 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 14:49:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 14:49:58,022 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 14:49:58,022 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 14:49:58,024 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 14:49:58,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 14:49:58,028 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:58,031 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 14:49:58,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 02:49:58 BoogieIcfgContainer [2021-12-14 14:49:58,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 14:49:58,129 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 14:49:58,129 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 14:49:58,130 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 14:49:58,130 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:49:34" (3/4) ... [2021-12-14 14:49:58,131 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 14:49:58,212 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 14:49:58,212 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 14:49:58,212 INFO L158 Benchmark]: Toolchain (without parser) took 24002.20ms. Allocated memory was 86.0MB in the beginning and 339.7MB in the end (delta: 253.8MB). Free memory was 56.1MB in the beginning and 146.4MB in the end (delta: -90.3MB). Peak memory consumption was 163.2MB. Max. memory is 16.1GB. [2021-12-14 14:49:58,213 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory was 42.9MB in the beginning and 42.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 14:49:58,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.93ms. Allocated memory is still 86.0MB. Free memory was 55.9MB in the beginning and 63.1MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 14:49:58,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.27ms. Allocated memory is still 86.0MB. Free memory was 63.1MB in the beginning and 61.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 14:49:58,214 INFO L158 Benchmark]: Boogie Preprocessor took 31.08ms. Allocated memory is still 86.0MB. Free memory was 61.8MB in the beginning and 60.9MB in the end (delta: 904.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 14:49:58,214 INFO L158 Benchmark]: RCFGBuilder took 255.74ms. Allocated memory is still 86.0MB. Free memory was 60.7MB in the beginning and 51.8MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 14:49:58,214 INFO L158 Benchmark]: TraceAbstraction took 23415.02ms. Allocated memory was 86.0MB in the beginning and 339.7MB in the end (delta: 253.8MB). Free memory was 51.4MB in the beginning and 157.9MB in the end (delta: -106.5MB). Peak memory consumption was 147.5MB. Max. memory is 16.1GB. [2021-12-14 14:49:58,214 INFO L158 Benchmark]: Witness Printer took 82.51ms. Allocated memory is still 339.7MB. Free memory was 157.9MB in the beginning and 146.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-14 14:49:58,218 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.15ms. Allocated memory is still 86.0MB. Free memory was 42.9MB in the beginning and 42.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.93ms. Allocated memory is still 86.0MB. Free memory was 55.9MB in the beginning and 63.1MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.27ms. Allocated memory is still 86.0MB. Free memory was 63.1MB in the beginning and 61.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.08ms. Allocated memory is still 86.0MB. Free memory was 61.8MB in the beginning and 60.9MB in the end (delta: 904.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 255.74ms. Allocated memory is still 86.0MB. Free memory was 60.7MB in the beginning and 51.8MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23415.02ms. Allocated memory was 86.0MB in the beginning and 339.7MB in the end (delta: 253.8MB). Free memory was 51.4MB in the beginning and 157.9MB in the end (delta: -106.5MB). Peak memory consumption was 147.5MB. Max. memory is 16.1GB. * Witness Printer took 82.51ms. Allocated memory is still 339.7MB. Free memory was 157.9MB in the beginning and 146.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [result=21, x=8] [L41] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 14, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1045 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 975 mSDsluCounter, 3659 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3255 mSDsCounter, 1242 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5510 IncrementalHoareTripleChecker+Invalid, 6752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1242 mSolverCounterUnsat, 404 mSDtfsCounter, 5510 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4962 GetRequests, 4594 SyntacticMatches, 15 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3354 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=13, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 176 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 4585 NumberOfCodeBlocks, 4111 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 6142 ConstructedInterpolants, 0 QuantifiedInterpolants, 9012 SizeOfPredicates, 48 NumberOfNonLiveVariables, 3660 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 35 InterpolantComputations, 2 PerfectInterpolantSequences, 56580/63747 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 RESULT: Ultimate proved your program to be incorrect! [2021-12-14 14:49:58,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE