./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci05.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 18ab16c8226f43cf595901df83a1f895912e466b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 08:45:55,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 08:45:55,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 08:45:55,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 08:45:55,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 08:45:55,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 08:45:55,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 08:45:55,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 08:45:55,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 08:45:55,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 08:45:55,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 08:45:55,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 08:45:55,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 08:45:55,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 08:45:55,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 08:45:55,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 08:45:55,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 08:45:55,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 08:45:55,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 08:45:55,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 08:45:55,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 08:45:55,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 08:45:55,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 08:45:55,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 08:45:55,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 08:45:55,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 08:45:55,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 08:45:55,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 08:45:55,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 08:45:55,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 08:45:55,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 08:45:55,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 08:45:55,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 08:45:55,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 08:45:55,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 08:45:55,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 08:45:55,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 08:45:55,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 08:45:55,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 08:45:55,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 08:45:55,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 08:45:55,158 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 08:45:55,183 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 08:45:55,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 08:45:55,184 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 08:45:55,184 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 08:45:55,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 08:45:55,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 08:45:55,186 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 08:45:55,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 08:45:55,186 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 08:45:55,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 08:45:55,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 08:45:55,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 08:45:55,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 08:45:55,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 08:45:55,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 08:45:55,187 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 08:45:55,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 08:45:55,188 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 08:45:55,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 08:45:55,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 08:45:55,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 08:45:55,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 08:45:55,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 08:45:55,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 08:45:55,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 08:45:55,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 08:45:55,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 08:45:55,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 08:45:55,189 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 08:45:55,189 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 08:45:55,189 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 -> 18ab16c8226f43cf595901df83a1f895912e466b [2021-08-26 08:45:55,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 08:45:55,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 08:45:55,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 08:45:55,476 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 08:45:55,476 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 08:45:55,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2021-08-26 08:45:55,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e995780/796f155943cb4a80a94d4f26b1f5d9f0/FLAGa1e18c3e1 [2021-08-26 08:45:55,867 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 08:45:55,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2021-08-26 08:45:55,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e995780/796f155943cb4a80a94d4f26b1f5d9f0/FLAGa1e18c3e1 [2021-08-26 08:45:56,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e995780/796f155943cb4a80a94d4f26b1f5d9f0 [2021-08-26 08:45:56,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 08:45:56,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 08:45:56,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 08:45:56,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 08:45:56,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 08:45:56,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:45:56" (1/1) ... [2021-08-26 08:45:56,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de367f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:56, skipping insertion in model container [2021-08-26 08:45:56,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:45:56" (1/1) ... [2021-08-26 08:45:56,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 08:45:56,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 08:45:56,402 WARN L228 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/Fibonacci05.c[746,759] [2021-08-26 08:45:56,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 08:45:56,410 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 08:45:56,426 WARN L228 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/Fibonacci05.c[746,759] [2021-08-26 08:45:56,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 08:45:56,436 INFO L208 MainTranslator]: Completed translation [2021-08-26 08:45:56,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:56 WrapperNode [2021-08-26 08:45:56,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 08:45:56,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 08:45:56,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 08:45:56,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 08:45:56,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:56" (1/1) ... [2021-08-26 08:45:56,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:56" (1/1) ... [2021-08-26 08:45:56,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 08:45:56,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 08:45:56,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 08:45:56,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 08:45:56,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:56" (1/1) ... [2021-08-26 08:45:56,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:56" (1/1) ... [2021-08-26 08:45:56,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:56" (1/1) ... [2021-08-26 08:45:56,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:56" (1/1) ... [2021-08-26 08:45:56,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:56" (1/1) ... [2021-08-26 08:45:56,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:56" (1/1) ... [2021-08-26 08:45:56,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:56" (1/1) ... [2021-08-26 08:45:56,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 08:45:56,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 08:45:56,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 08:45:56,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 08:45:56,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:56" (1/1) ... [2021-08-26 08:45:56,506 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 08:45:56,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:45:56,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 08:45:56,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 08:45:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-08-26 08:45:56,576 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-08-26 08:45:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 08:45:56,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 08:45:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 08:45:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 08:45:56,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 08:45:56,771 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-26 08:45:56,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:45:56 BoogieIcfgContainer [2021-08-26 08:45:56,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 08:45:56,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 08:45:56,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 08:45:56,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 08:45:56,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:45:56" (1/3) ... [2021-08-26 08:45:56,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4885b1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:45:56, skipping insertion in model container [2021-08-26 08:45:56,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:56" (2/3) ... [2021-08-26 08:45:56,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4885b1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:45:56, skipping insertion in model container [2021-08-26 08:45:56,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:45:56" (3/3) ... [2021-08-26 08:45:56,777 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2021-08-26 08:45:56,780 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 08:45:56,780 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 08:45:56,838 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 08:45:56,842 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 08:45:56,842 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 08:45:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-26 08:45:56,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 08:45:56,856 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:45:56,856 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:45:56,856 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:45:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:45:56,860 INFO L82 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2021-08-26 08:45:56,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:45:56,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536539162] [2021-08-26 08:45:56,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:56,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:45:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:56,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:45:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:45:57,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:45:57,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536539162] [2021-08-26 08:45:57,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536539162] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:45:57,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:45:57,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 08:45:57,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160203967] [2021-08-26 08:45:57,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:45:57,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:45:57,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:45:57,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:45:57,034 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-08-26 08:45:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:45:57,124 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-08-26 08:45:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 08:45:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-08-26 08:45:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:45:57,133 INFO L225 Difference]: With dead ends: 31 [2021-08-26 08:45:57,133 INFO L226 Difference]: Without dead ends: 18 [2021-08-26 08:45:57,136 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 08:45:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-08-26 08:45:57,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-08-26 08:45:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-26 08:45:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-26 08:45:57,170 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-08-26 08:45:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:45:57,171 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-26 08:45:57,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-08-26 08:45:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-26 08:45:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 08:45:57,173 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:45:57,173 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:45:57,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 08:45:57,174 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:45:57,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:45:57,175 INFO L82 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2021-08-26 08:45:57,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:45:57,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651145358] [2021-08-26 08:45:57,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:57,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:45:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:57,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:45:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:45:57,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:45:57,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651145358] [2021-08-26 08:45:57,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651145358] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:45:57,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:45:57,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 08:45:57,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765833052] [2021-08-26 08:45:57,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:45:57,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:45:57,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:45:57,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:45:57,285 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-08-26 08:45:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:45:57,372 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-08-26 08:45:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 08:45:57,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-08-26 08:45:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:45:57,374 INFO L225 Difference]: With dead ends: 24 [2021-08-26 08:45:57,374 INFO L226 Difference]: Without dead ends: 20 [2021-08-26 08:45:57,375 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 08:45:57,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-26 08:45:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-08-26 08:45:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-26 08:45:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-26 08:45:57,379 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-08-26 08:45:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:45:57,379 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-26 08:45:57,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-08-26 08:45:57,380 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-26 08:45:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 08:45:57,380 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:45:57,380 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:45:57,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 08:45:57,381 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:45:57,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:45:57,381 INFO L82 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2021-08-26 08:45:57,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:45:57,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047271517] [2021-08-26 08:45:57,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:57,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:45:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:57,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:45:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:57,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:57,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-26 08:45:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 08:45:57,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:45:57,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047271517] [2021-08-26 08:45:57,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047271517] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:57,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961876679] [2021-08-26 08:45:57,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:57,517 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:45:57,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:45:57,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:45:57,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 08:45:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:57,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 08:45:57,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:45:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 08:45:57,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961876679] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:57,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:45:57,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-08-26 08:45:57,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129402380] [2021-08-26 08:45:57,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 08:45:57,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:45:57,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 08:45:57,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-26 08:45:57,805 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-26 08:45:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:45:57,927 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-08-26 08:45:57,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 08:45:57,928 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 23 [2021-08-26 08:45:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:45:57,928 INFO L225 Difference]: With dead ends: 35 [2021-08-26 08:45:57,929 INFO L226 Difference]: Without dead ends: 20 [2021-08-26 08:45:57,929 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 105.3ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-08-26 08:45:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-26 08:45:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-08-26 08:45:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-26 08:45:57,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-08-26 08:45:57,933 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-08-26 08:45:57,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:45:57,933 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-08-26 08:45:57,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-26 08:45:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-08-26 08:45:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 08:45:57,934 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:45:57,934 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:45:57,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 08:45:58,140 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-08-26 08:45:58,141 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:45:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:45:58,142 INFO L82 PathProgramCache]: Analyzing trace with hash 187716987, now seen corresponding path program 1 times [2021-08-26 08:45:58,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:45:58,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869631877] [2021-08-26 08:45:58,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:58,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:45:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:45:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:45:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 08:45:58,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:45:58,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869631877] [2021-08-26 08:45:58,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869631877] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:58,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380905163] [2021-08-26 08:45:58,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:58,249 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:45:58,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:45:58,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:45:58,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 08:45:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 08:45:58,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:45:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 08:45:58,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380905163] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:58,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:45:58,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-08-26 08:45:58,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910801786] [2021-08-26 08:45:58,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 08:45:58,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:45:58,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 08:45:58,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-26 08:45:58,476 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-26 08:45:58,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:45:58,577 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-08-26 08:45:58,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 08:45:58,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2021-08-26 08:45:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:45:58,579 INFO L225 Difference]: With dead ends: 38 [2021-08-26 08:45:58,579 INFO L226 Difference]: Without dead ends: 34 [2021-08-26 08:45:58,580 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 47.7ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-08-26 08:45:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-08-26 08:45:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-08-26 08:45:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2021-08-26 08:45:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-08-26 08:45:58,586 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-08-26 08:45:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:45:58,587 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-08-26 08:45:58,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-26 08:45:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-08-26 08:45:58,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-26 08:45:58,588 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:45:58,588 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:45:58,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 08:45:58,788 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-08-26 08:45:58,789 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:45:58,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:45:58,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1151618030, now seen corresponding path program 2 times [2021-08-26 08:45:58,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:45:58,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891237905] [2021-08-26 08:45:58,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:58,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:45:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:45:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:45:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:45:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,898 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-26 08:45:58,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:45:58,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891237905] [2021-08-26 08:45:58,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891237905] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:58,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581731025] [2021-08-26 08:45:58,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 08:45:58,899 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:45:58,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:45:58,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:45:58,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 08:45:58,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 08:45:58,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:45:58,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 08:45:58,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:45:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-26 08:45:59,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581731025] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:59,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:45:59,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-08-26 08:45:59,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159396227] [2021-08-26 08:45:59,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 08:45:59,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:45:59,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 08:45:59,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-26 08:45:59,101 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-08-26 08:45:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:45:59,250 INFO L93 Difference]: Finished difference Result 68 states and 103 transitions. [2021-08-26 08:45:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 08:45:59,251 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Word has length 37 [2021-08-26 08:45:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:45:59,252 INFO L225 Difference]: With dead ends: 68 [2021-08-26 08:45:59,252 INFO L226 Difference]: Without dead ends: 35 [2021-08-26 08:45:59,252 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 104.1ms TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-08-26 08:45:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-08-26 08:45:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-08-26 08:45:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2021-08-26 08:45:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2021-08-26 08:45:59,256 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 37 [2021-08-26 08:45:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:45:59,256 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2021-08-26 08:45:59,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-08-26 08:45:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2021-08-26 08:45:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-26 08:45:59,258 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:45:59,258 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:45:59,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 08:45:59,477 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-08-26 08:45:59,478 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:45:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:45:59,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1916996739, now seen corresponding path program 3 times [2021-08-26 08:45:59,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:45:59,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126199783] [2021-08-26 08:45:59,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:59,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:45:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:45:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:45:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:45:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:45:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:45:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:45:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-08-26 08:45:59,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:45:59,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126199783] [2021-08-26 08:45:59,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126199783] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:59,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295658141] [2021-08-26 08:45:59,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 08:45:59,627 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:45:59,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:45:59,628 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-08-26 08:45:59,629 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-08-26 08:45:59,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-08-26 08:45:59,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:45:59,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 08:45:59,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:45:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 89 proven. 32 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-08-26 08:45:59,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295658141] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:59,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:45:59,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2021-08-26 08:45:59,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597547201] [2021-08-26 08:45:59,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-26 08:45:59,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:45:59,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-26 08:45:59,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-08-26 08:45:59,880 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2021-08-26 08:45:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:45:59,995 INFO L93 Difference]: Finished difference Result 93 states and 139 transitions. [2021-08-26 08:45:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-26 08:45:59,996 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) Word has length 79 [2021-08-26 08:45:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:45:59,998 INFO L225 Difference]: With dead ends: 93 [2021-08-26 08:45:59,998 INFO L226 Difference]: Without dead ends: 87 [2021-08-26 08:45:59,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 57.0ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-08-26 08:45:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-08-26 08:46:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2021-08-26 08:46:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 16 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (43), 21 states have call predecessors, (43), 16 states have call successors, (43) [2021-08-26 08:46:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 121 transitions. [2021-08-26 08:46:00,008 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 121 transitions. Word has length 79 [2021-08-26 08:46:00,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:00,008 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 121 transitions. [2021-08-26 08:46:00,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2021-08-26 08:46:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 121 transitions. [2021-08-26 08:46:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-08-26 08:46:00,011 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:00,012 INFO L512 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:00,030 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-08-26 08:46:00,228 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-08-26 08:46:00,228 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:00,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:00,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1766942948, now seen corresponding path program 4 times [2021-08-26 08:46:00,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:00,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650935768] [2021-08-26 08:46:00,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:00,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-08-26 08:46:00,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:00,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650935768] [2021-08-26 08:46:00,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650935768] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:00,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588595666] [2021-08-26 08:46:00,555 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 08:46:00,555 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:00,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:46:00,557 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-08-26 08:46:00,584 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-08-26 08:46:00,691 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 08:46:00,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:46:00,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-26 08:46:00,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:46:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-08-26 08:46:01,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588595666] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:01,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:46:01,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 16 [2021-08-26 08:46:01,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067446036] [2021-08-26 08:46:01,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-26 08:46:01,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:01,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-26 08:46:01,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-08-26 08:46:01,070 INFO L87 Difference]: Start difference. First operand 81 states and 121 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) [2021-08-26 08:46:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:01,222 INFO L93 Difference]: Finished difference Result 205 states and 344 transitions. [2021-08-26 08:46:01,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 08:46:01,222 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) Word has length 174 [2021-08-26 08:46:01,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:01,226 INFO L225 Difference]: With dead ends: 205 [2021-08-26 08:46:01,226 INFO L226 Difference]: Without dead ends: 201 [2021-08-26 08:46:01,226 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 63.1ms TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2021-08-26 08:46:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-08-26 08:46:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 189. [2021-08-26 08:46:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 121 states have (on average 1.1900826446280992) internal successors, (144), 121 states have internal predecessors, (144), 42 states have call successors, (42), 13 states have call predecessors, (42), 25 states have return successors, (137), 54 states have call predecessors, (137), 42 states have call successors, (137) [2021-08-26 08:46:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 323 transitions. [2021-08-26 08:46:01,249 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 323 transitions. Word has length 174 [2021-08-26 08:46:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:01,250 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 323 transitions. [2021-08-26 08:46:01,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) [2021-08-26 08:46:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 323 transitions. [2021-08-26 08:46:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-08-26 08:46:01,253 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:01,253 INFO L512 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:01,271 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-08-26 08:46:01,470 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-08-26 08:46:01,471 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash -778425254, now seen corresponding path program 5 times [2021-08-26 08:46:01,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:01,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693110962] [2021-08-26 08:46:01,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:01,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 08:46:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:01,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2021-08-26 08:46:01,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:01,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693110962] [2021-08-26 08:46:01,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693110962] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:01,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141285447] [2021-08-26 08:46:01,890 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-26 08:46:01,890 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:01,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:46:01,891 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-08-26 08:46:01,892 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-08-26 08:46:02,126 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2021-08-26 08:46:02,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:46:02,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-26 08:46:02,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:46:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 801 proven. 327 refuted. 0 times theorem prover too weak. 3440 trivial. 0 not checked. [2021-08-26 08:46:02,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141285447] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:02,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:46:02,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 19 [2021-08-26 08:46:02,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985138815] [2021-08-26 08:46:02,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-26 08:46:02,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:02,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-26 08:46:02,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-08-26 08:46:02,721 INFO L87 Difference]: Start difference. First operand 189 states and 323 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (24), 15 states have call predecessors, (24), 12 states have call successors, (24) [2021-08-26 08:46:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:02,930 INFO L93 Difference]: Finished difference Result 297 states and 574 transitions. [2021-08-26 08:46:02,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-26 08:46:02,931 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (24), 15 states have call predecessors, (24), 12 states have call successors, (24) Word has length 283 [2021-08-26 08:46:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:02,934 INFO L225 Difference]: With dead ends: 297 [2021-08-26 08:46:02,934 INFO L226 Difference]: Without dead ends: 100 [2021-08-26 08:46:02,936 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 99.5ms TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2021-08-26 08:46:02,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-08-26 08:46:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 71. [2021-08-26 08:46:02,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (43), 15 states have call predecessors, (43), 13 states have call successors, (43) [2021-08-26 08:46:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 115 transitions. [2021-08-26 08:46:02,946 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 115 transitions. Word has length 283 [2021-08-26 08:46:02,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:02,946 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 115 transitions. [2021-08-26 08:46:02,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (24), 15 states have call predecessors, (24), 12 states have call successors, (24) [2021-08-26 08:46:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 115 transitions. [2021-08-26 08:46:02,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-08-26 08:46:02,952 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:02,952 INFO L512 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:02,975 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-08-26 08:46:03,172 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-08-26 08:46:03,173 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:03,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:03,173 INFO L82 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 6 times [2021-08-26 08:46:03,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:03,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703072644] [2021-08-26 08:46:03,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:03,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 08:46:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-08-26 08:46:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 08:46:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:03,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:04,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:04,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2021-08-26 08:46:04,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:04,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703072644] [2021-08-26 08:46:04,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703072644] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:04,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162228331] [2021-08-26 08:46:04,010 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-26 08:46:04,010 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:04,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:46:04,024 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-08-26 08:46:04,068 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-08-26 08:46:04,508 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2021-08-26 08:46:04,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:46:04,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-26 08:46:04,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:46:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2668 proven. 293 refuted. 0 times theorem prover too weak. 13446 trivial. 0 not checked. [2021-08-26 08:46:05,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162228331] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:05,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:46:05,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12] total 30 [2021-08-26 08:46:05,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854775849] [2021-08-26 08:46:05,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-26 08:46:05,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:05,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-26 08:46:05,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2021-08-26 08:46:05,516 INFO L87 Difference]: Start difference. First operand 71 states and 115 transitions. Second operand has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 16 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (36), 26 states have call predecessors, (36), 16 states have call successors, (36) [2021-08-26 08:46:06,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:06,180 INFO L93 Difference]: Finished difference Result 189 states and 398 transitions. [2021-08-26 08:46:06,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-26 08:46:06,181 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 16 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (36), 26 states have call predecessors, (36), 16 states have call successors, (36) Word has length 528 [2021-08-26 08:46:06,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:06,182 INFO L225 Difference]: With dead ends: 189 [2021-08-26 08:46:06,182 INFO L226 Difference]: Without dead ends: 121 [2021-08-26 08:46:06,183 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 686 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 404.2ms TimeCoverageRelationStatistics Valid=649, Invalid=2543, Unknown=0, NotChecked=0, Total=3192 [2021-08-26 08:46:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-08-26 08:46:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2021-08-26 08:46:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 80 states have (on average 1.075) internal successors, (86), 75 states have internal predecessors, (86), 21 states have call successors, (21), 18 states have call predecessors, (21), 9 states have return successors, (46), 17 states have call predecessors, (46), 21 states have call successors, (46) [2021-08-26 08:46:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 153 transitions. [2021-08-26 08:46:06,191 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 153 transitions. Word has length 528 [2021-08-26 08:46:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:06,192 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 153 transitions. [2021-08-26 08:46:06,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 16 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (36), 26 states have call predecessors, (36), 16 states have call successors, (36) [2021-08-26 08:46:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 153 transitions. [2021-08-26 08:46:06,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-08-26 08:46:06,196 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:06,196 INFO L512 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:06,217 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-08-26 08:46:06,417 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-08-26 08:46:06,417 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:06,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:06,417 INFO L82 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 7 times [2021-08-26 08:46:06,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:06,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157322289] [2021-08-26 08:46:06,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:06,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 08:46:06,453 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 08:46:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 08:46:06,559 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 08:46:06,559 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 08:46:06,560 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 08:46:06,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 08:46:06,566 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 08:46:06,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 08:46:06 BoogieIcfgContainer [2021-08-26 08:46:06,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 08:46:06,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 08:46:06,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 08:46:06,678 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 08:46:06,678 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:45:56" (3/4) ... [2021-08-26 08:46:06,680 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 08:46:06,774 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 08:46:06,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 08:46:06,775 INFO L168 Benchmark]: Toolchain (without parser) took 10473.66 ms. Allocated memory was 69.2 MB in the beginning and 211.8 MB in the end (delta: 142.6 MB). Free memory was 44.5 MB in the beginning and 70.2 MB in the end (delta: -25.8 MB). Peak memory consumption was 115.2 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:06,775 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 48.2 MB. Free memory was 29.0 MB in the beginning and 29.0 MB in the end (delta: 37.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 08:46:06,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.27 ms. Allocated memory is still 69.2 MB. Free memory was 44.4 MB in the beginning and 52.2 MB in the end (delta: -7.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:06,776 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.51 ms. Allocated memory is still 69.2 MB. Free memory was 52.2 MB in the beginning and 52.5 MB in the end (delta: -366.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:06,776 INFO L168 Benchmark]: Boogie Preprocessor took 25.40 ms. Allocated memory is still 69.2 MB. Free memory was 52.5 MB in the beginning and 51.8 MB in the end (delta: 768.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 08:46:06,777 INFO L168 Benchmark]: RCFGBuilder took 272.66 ms. Allocated memory is still 69.2 MB. Free memory was 51.5 MB in the beginning and 39.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:06,777 INFO L168 Benchmark]: TraceAbstraction took 9903.79 ms. Allocated memory was 69.2 MB in the beginning and 211.8 MB in the end (delta: 142.6 MB). Free memory was 39.2 MB in the beginning and 89.1 MB in the end (delta: -50.0 MB). Peak memory consumption was 94.7 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:06,777 INFO L168 Benchmark]: Witness Printer took 96.34 ms. Allocated memory is still 211.8 MB. Free memory was 89.1 MB in the beginning and 70.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:06,778 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.15 ms. Allocated memory is still 48.2 MB. Free memory was 29.0 MB in the beginning and 29.0 MB in the end (delta: 37.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 135.27 ms. Allocated memory is still 69.2 MB. Free memory was 44.4 MB in the beginning and 52.2 MB in the end (delta: -7.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 33.51 ms. Allocated memory is still 69.2 MB. Free memory was 52.2 MB in the beginning and 52.5 MB in the end (delta: -366.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.40 ms. Allocated memory is still 69.2 MB. Free memory was 52.5 MB in the beginning and 51.8 MB in the end (delta: 768.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 272.66 ms. Allocated memory is still 69.2 MB. Free memory was 51.5 MB in the beginning and 39.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9903.79 ms. Allocated memory was 69.2 MB in the beginning and 211.8 MB in the end (delta: 142.6 MB). Free memory was 39.2 MB in the beginning and 89.1 MB in the end (delta: -50.0 MB). Peak memory consumption was 94.7 MB. Max. memory is 16.1 GB. * Witness Printer took 96.34 ms. Allocated memory is still 211.8 MB. Free memory was 89.1 MB in the beginning and 70.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L33] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9727.2ms, OverallIterations: 10, TraceHistogramMax: 77, EmptinessCheckTime: 26.6ms, AutomataDifference: 1746.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 155 SDtfs, 571 SDslu, 509 SDs, 0 SdLazy, 1297 SolverSat, 733 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 829.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1629 GetRequests, 1480 SyntacticMatches, 3 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 933.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=7, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 90.5ms AutomataMinimizationTime, 9 MinimizatonAttempts, 59 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 107.9ms SsaConstructionTime, 542.1ms SatisfiabilityAnalysisTime, 4767.4ms InterpolantComputationTime, 2777 NumberOfCodeBlocks, 2691 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 2301 ConstructedInterpolants, 0 QuantifiedInterpolants, 3541 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2577 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 40160/45994 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-08-26 08:46:06,810 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...