./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 54858612 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.0-5485861 [2020-10-25 23:09:12,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 23:09:12,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 23:09:13,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 23:09:13,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 23:09:13,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 23:09:13,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 23:09:13,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 23:09:13,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 23:09:13,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 23:09:13,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 23:09:13,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 23:09:13,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 23:09:13,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 23:09:13,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 23:09:13,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 23:09:13,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 23:09:13,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 23:09:13,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 23:09:13,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 23:09:13,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 23:09:13,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 23:09:13,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 23:09:13,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 23:09:13,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 23:09:13,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 23:09:13,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 23:09:13,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 23:09:13,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 23:09:13,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 23:09:13,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 23:09:13,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 23:09:13,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 23:09:13,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 23:09:13,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 23:09:13,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 23:09:13,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 23:09:13,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 23:09:13,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 23:09:13,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 23:09:13,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 23:09:13,120 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 23:09:13,169 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 23:09:13,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 23:09:13,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 23:09:13,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 23:09:13,173 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 23:09:13,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 23:09:13,174 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 23:09:13,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 23:09:13,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 23:09:13,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 23:09:13,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 23:09:13,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 23:09:13,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 23:09:13,176 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 23:09:13,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 23:09:13,177 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 23:09:13,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 23:09:13,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 23:09:13,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 23:09:13,178 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 23:09:13,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 23:09:13,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:09:13,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 23:09:13,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 23:09:13,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 23:09:13,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 23:09:13,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 23:09:13,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 23:09:13,180 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 23:09:13,181 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 [2020-10-25 23:09:13,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 23:09:13,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 23:09:13,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 23:09:13,598 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 23:09:13,599 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 23:09:13,600 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2020-10-25 23:09:13,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f054b9f/09a0703cfd464daa844a1c1f2b7aa4c4/FLAGb455a5299 [2020-10-25 23:09:14,220 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 23:09:14,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2020-10-25 23:09:14,229 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f054b9f/09a0703cfd464daa844a1c1f2b7aa4c4/FLAGb455a5299 [2020-10-25 23:09:14,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f054b9f/09a0703cfd464daa844a1c1f2b7aa4c4 [2020-10-25 23:09:14,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 23:09:14,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 23:09:14,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 23:09:14,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 23:09:14,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 23:09:14,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:09:14" (1/1) ... [2020-10-25 23:09:14,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc664c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:14, skipping insertion in model container [2020-10-25 23:09:14,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:09:14" (1/1) ... [2020-10-25 23:09:14,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 23:09:14,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 23:09:14,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:09:14,889 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 23:09:14,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:09:14,925 INFO L208 MainTranslator]: Completed translation [2020-10-25 23:09:14,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:14 WrapperNode [2020-10-25 23:09:14,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 23:09:14,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 23:09:14,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 23:09:14,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 23:09:14,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:14" (1/1) ... [2020-10-25 23:09:14,944 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:14" (1/1) ... [2020-10-25 23:09:14,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 23:09:14,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 23:09:14,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 23:09:14,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 23:09:14,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:14" (1/1) ... [2020-10-25 23:09:14,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:14" (1/1) ... [2020-10-25 23:09:14,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:14" (1/1) ... [2020-10-25 23:09:14,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:14" (1/1) ... [2020-10-25 23:09:14,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:14" (1/1) ... [2020-10-25 23:09:14,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:14" (1/1) ... [2020-10-25 23:09:14,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:14" (1/1) ... [2020-10-25 23:09:14,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 23:09:14,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 23:09:14,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 23:09:14,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 23:09:14,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:09:15,077 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-10-25 23:09:15,077 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-10-25 23:09:15,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 23:09:15,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 23:09:15,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 23:09:15,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 23:09:15,302 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 23:09:15,302 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-25 23:09:15,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:09:15 BoogieIcfgContainer [2020-10-25 23:09:15,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 23:09:15,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 23:09:15,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 23:09:15,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 23:09:15,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 11:09:14" (1/3) ... [2020-10-25 23:09:15,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745df6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:09:15, skipping insertion in model container [2020-10-25 23:09:15,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:14" (2/3) ... [2020-10-25 23:09:15,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745df6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:09:15, skipping insertion in model container [2020-10-25 23:09:15,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:09:15" (3/3) ... [2020-10-25 23:09:15,313 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-10-25 23:09:15,325 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 23:09:15,334 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 23:09:15,348 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 23:09:15,377 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 23:09:15,377 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 23:09:15,377 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 23:09:15,378 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 23:09:15,378 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 23:09:15,378 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 23:09:15,378 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 23:09:15,379 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 23:09:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-10-25 23:09:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-25 23:09:15,402 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:15,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:15,404 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:15,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:15,411 INFO L82 PathProgramCache]: Analyzing trace with hash -691997320, now seen corresponding path program 1 times [2020-10-25 23:09:15,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:15,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12672672] [2020-10-25 23:09:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:15,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:09:15,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12672672] [2020-10-25 23:09:15,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:09:15,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:09:15,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100295561] [2020-10-25 23:09:15,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:09:15,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:15,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:09:15,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:09:15,889 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-10-25 23:09:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:16,021 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-10-25 23:09:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:09:16,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-25 23:09:16,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:16,033 INFO L225 Difference]: With dead ends: 32 [2020-10-25 23:09:16,033 INFO L226 Difference]: Without dead ends: 18 [2020-10-25 23:09:16,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 23:09:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-10-25 23:09:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-25 23:09:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-25 23:09:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-10-25 23:09:16,082 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2020-10-25 23:09:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:16,082 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-10-25 23:09:16,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:09:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-10-25 23:09:16,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 23:09:16,084 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:16,085 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:16,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 23:09:16,085 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:16,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:16,086 INFO L82 PathProgramCache]: Analyzing trace with hash 717045018, now seen corresponding path program 1 times [2020-10-25 23:09:16,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:16,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128110517] [2020-10-25 23:09:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:16,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:09:16,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128110517] [2020-10-25 23:09:16,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:09:16,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:09:16,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305666377] [2020-10-25 23:09:16,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:09:16,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:16,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:09:16,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:09:16,159 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2020-10-25 23:09:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:16,225 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-10-25 23:09:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:09:16,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-25 23:09:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:16,227 INFO L225 Difference]: With dead ends: 24 [2020-10-25 23:09:16,228 INFO L226 Difference]: Without dead ends: 20 [2020-10-25 23:09:16,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 23:09:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-25 23:09:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-10-25 23:09:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-25 23:09:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-10-25 23:09:16,237 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2020-10-25 23:09:16,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:16,238 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-10-25 23:09:16,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:09:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-10-25 23:09:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-25 23:09:16,240 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:16,240 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:16,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 23:09:16,240 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:16,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:16,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1426922965, now seen corresponding path program 1 times [2020-10-25 23:09:16,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:16,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737631557] [2020-10-25 23:09:16,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:16,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:16,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:16,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-25 23:09:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-25 23:09:16,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737631557] [2020-10-25 23:09:16,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410401332] [2020-10-25 23:09:16,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:16,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-25 23:09:16,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-25 23:09:16,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:16,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-10-25 23:09:16,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64421063] [2020-10-25 23:09:16,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 23:09:16,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:16,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 23:09:16,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-25 23:09:16,630 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2020-10-25 23:09:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:16,840 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-10-25 23:09:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 23:09:16,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-25 23:09:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:16,842 INFO L225 Difference]: With dead ends: 35 [2020-10-25 23:09:16,842 INFO L226 Difference]: Without dead ends: 20 [2020-10-25 23:09:16,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-10-25 23:09:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-25 23:09:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-25 23:09:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-25 23:09:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-10-25 23:09:16,857 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2020-10-25 23:09:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:16,858 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-10-25 23:09:16,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 23:09:16,859 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-10-25 23:09:16,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 23:09:16,862 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:16,863 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:17,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-25 23:09:17,077 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:17,079 INFO L82 PathProgramCache]: Analyzing trace with hash 301752507, now seen corresponding path program 1 times [2020-10-25 23:09:17,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:17,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749426104] [2020-10-25 23:09:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:17,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:17,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:17,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-25 23:09:17,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749426104] [2020-10-25 23:09:17,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615635264] [2020-10-25 23:09:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:17,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-25 23:09:17,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-25 23:09:17,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:17,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-25 23:09:17,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060194024] [2020-10-25 23:09:17,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 23:09:17,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:17,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 23:09:17,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-25 23:09:17,275 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 7 states. [2020-10-25 23:09:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:17,368 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2020-10-25 23:09:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 23:09:17,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-25 23:09:17,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:17,372 INFO L225 Difference]: With dead ends: 38 [2020-10-25 23:09:17,375 INFO L226 Difference]: Without dead ends: 34 [2020-10-25 23:09:17,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-25 23:09:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-25 23:09:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-25 23:09:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-25 23:09:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-10-25 23:09:17,390 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2020-10-25 23:09:17,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:17,390 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-10-25 23:09:17,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 23:09:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-10-25 23:09:17,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-25 23:09:17,393 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:17,393 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:17,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:17,607 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:17,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:17,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1093063438, now seen corresponding path program 2 times [2020-10-25 23:09:17,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:17,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429367010] [2020-10-25 23:09:17,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:17,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:17,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:17,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:17,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:17,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-25 23:09:17,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429367010] [2020-10-25 23:09:17,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540599375] [2020-10-25 23:09:17,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:17,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 23:09:17,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:09:17,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-25 23:09:17,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-25 23:09:17,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:17,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-10-25 23:09:17,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789058003] [2020-10-25 23:09:17,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-25 23:09:17,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:17,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-25 23:09:17,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-25 23:09:17,999 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 12 states. [2020-10-25 23:09:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:18,288 INFO L93 Difference]: Finished difference Result 68 states and 103 transitions. [2020-10-25 23:09:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-25 23:09:18,289 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2020-10-25 23:09:18,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:18,293 INFO L225 Difference]: With dead ends: 68 [2020-10-25 23:09:18,293 INFO L226 Difference]: Without dead ends: 35 [2020-10-25 23:09:18,296 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-10-25 23:09:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-25 23:09:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-25 23:09:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-25 23:09:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2020-10-25 23:09:18,309 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 37 [2020-10-25 23:09:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:18,313 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2020-10-25 23:09:18,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-25 23:09:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2020-10-25 23:09:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-25 23:09:18,325 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:18,325 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:18,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:18,541 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:18,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:18,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1356719978, now seen corresponding path program 3 times [2020-10-25 23:09:18,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:18,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869221390] [2020-10-25 23:09:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:18,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:18,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:18,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:18,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:18,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:18,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:18,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:18,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:18,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-25 23:09:18,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869221390] [2020-10-25 23:09:18,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357159141] [2020-10-25 23:09:18,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:18,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-25 23:09:18,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:09:18,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-25 23:09:18,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-10-25 23:09:18,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:18,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-10-25 23:09:18,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588561342] [2020-10-25 23:09:18,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 23:09:18,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:18,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 23:09:18,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-25 23:09:18,925 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 10 states. [2020-10-25 23:09:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:19,247 INFO L93 Difference]: Finished difference Result 84 states and 123 transitions. [2020-10-25 23:09:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-25 23:09:19,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2020-10-25 23:09:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:19,250 INFO L225 Difference]: With dead ends: 84 [2020-10-25 23:09:19,250 INFO L226 Difference]: Without dead ends: 47 [2020-10-25 23:09:19,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-10-25 23:09:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-25 23:09:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2020-10-25 23:09:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-25 23:09:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2020-10-25 23:09:19,265 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 65 [2020-10-25 23:09:19,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:19,266 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2020-10-25 23:09:19,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 23:09:19,267 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2020-10-25 23:09:19,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-10-25 23:09:19,269 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:19,269 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:19,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:19,473 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:19,475 INFO L82 PathProgramCache]: Analyzing trace with hash 876254947, now seen corresponding path program 4 times [2020-10-25 23:09:19,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:19,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130654468] [2020-10-25 23:09:19,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-10-25 23:09:19,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130654468] [2020-10-25 23:09:19,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852555660] [2020-10-25 23:09:19,795 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:19,871 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-25 23:09:19,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:09:19,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 23:09:19,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-10-25 23:09:19,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:19,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-25 23:09:19,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907573115] [2020-10-25 23:09:19,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 23:09:19,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:19,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 23:09:19,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-25 23:09:19,977 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand 10 states. [2020-10-25 23:09:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:20,272 INFO L93 Difference]: Finished difference Result 114 states and 173 transitions. [2020-10-25 23:09:20,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-25 23:09:20,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2020-10-25 23:09:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:20,277 INFO L225 Difference]: With dead ends: 114 [2020-10-25 23:09:20,277 INFO L226 Difference]: Without dead ends: 110 [2020-10-25 23:09:20,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-10-25 23:09:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-25 23:09:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2020-10-25 23:09:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-25 23:09:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2020-10-25 23:09:20,300 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 106 [2020-10-25 23:09:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:20,301 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2020-10-25 23:09:20,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 23:09:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2020-10-25 23:09:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-10-25 23:09:20,305 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:20,305 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:20,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-25 23:09:20,518 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:20,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1600878918, now seen corresponding path program 5 times [2020-10-25 23:09:20,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:20,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87440859] [2020-10-25 23:09:20,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:09:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:20,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:21,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:21,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:21,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:21,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:21,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:21,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:21,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:21,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:21,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 422 proven. 660 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2020-10-25 23:09:21,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87440859] [2020-10-25 23:09:21,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839903065] [2020-10-25 23:09:21,169 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:21,270 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2020-10-25 23:09:21,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:09:21,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-25 23:09:21,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 620 proven. 476 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2020-10-25 23:09:21,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:21,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2020-10-25 23:09:21,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764235487] [2020-10-25 23:09:21,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-25 23:09:21,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:21,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-25 23:09:21,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-10-25 23:09:21,469 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand 18 states. [2020-10-25 23:09:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:22,215 INFO L93 Difference]: Finished difference Result 187 states and 337 transitions. [2020-10-25 23:09:22,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-25 23:09:22,216 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 201 [2020-10-25 23:09:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:22,218 INFO L225 Difference]: With dead ends: 187 [2020-10-25 23:09:22,218 INFO L226 Difference]: Without dead ends: 89 [2020-10-25 23:09:22,221 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2020-10-25 23:09:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-25 23:09:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2020-10-25 23:09:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-25 23:09:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2020-10-25 23:09:22,235 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 201 [2020-10-25 23:09:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:22,236 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2020-10-25 23:09:22,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-25 23:09:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2020-10-25 23:09:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-10-25 23:09:22,239 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:22,239 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:22,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:22,453 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:22,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:22,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1830568536, now seen corresponding path program 6 times [2020-10-25 23:09:22,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:22,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025698938] [2020-10-25 23:09:22,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:09:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-10-25 23:09:22,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025698938] [2020-10-25 23:09:22,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334284465] [2020-10-25 23:09:22,808 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:22,918 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2020-10-25 23:09:22,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:09:22,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-25 23:09:22,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2020-10-25 23:09:23,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:23,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-10-25 23:09:23,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062544150] [2020-10-25 23:09:23,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-25 23:09:23,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:23,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-25 23:09:23,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-25 23:09:23,024 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand 11 states. [2020-10-25 23:09:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:23,273 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2020-10-25 23:09:23,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-25 23:09:23,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 174 [2020-10-25 23:09:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:23,276 INFO L225 Difference]: With dead ends: 82 [2020-10-25 23:09:23,276 INFO L226 Difference]: Without dead ends: 78 [2020-10-25 23:09:23,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2020-10-25 23:09:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-25 23:09:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-10-25 23:09:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-25 23:09:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2020-10-25 23:09:23,299 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 174 [2020-10-25 23:09:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:23,299 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2020-10-25 23:09:23,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-25 23:09:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2020-10-25 23:09:23,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-10-25 23:09:23,308 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:23,308 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:23,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:23,509 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:23,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:23,510 INFO L82 PathProgramCache]: Analyzing trace with hash 267357610, now seen corresponding path program 7 times [2020-10-25 23:09:23,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:23,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010303498] [2020-10-25 23:09:23,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:09:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:23,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-25 23:09:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-10-25 23:09:24,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010303498] [2020-10-25 23:09:24,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968088487] [2020-10-25 23:09:24,218 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:24,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-25 23:09:24,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-10-25 23:09:24,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:24,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-25 23:09:24,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962740395] [2020-10-25 23:09:24,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-25 23:09:24,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:24,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-25 23:09:24,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-25 23:09:24,490 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand 12 states. [2020-10-25 23:09:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:24,798 INFO L93 Difference]: Finished difference Result 260 states and 386 transitions. [2020-10-25 23:09:24,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-25 23:09:24,799 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 283 [2020-10-25 23:09:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:24,803 INFO L225 Difference]: With dead ends: 260 [2020-10-25 23:09:24,804 INFO L226 Difference]: Without dead ends: 256 [2020-10-25 23:09:24,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2020-10-25 23:09:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-10-25 23:09:24,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 241. [2020-10-25 23:09:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-10-25 23:09:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 358 transitions. [2020-10-25 23:09:24,854 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 358 transitions. Word has length 283 [2020-10-25 23:09:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:24,859 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 358 transitions. [2020-10-25 23:09:24,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-25 23:09:24,859 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 358 transitions. [2020-10-25 23:09:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2020-10-25 23:09:24,868 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:24,869 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:25,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-25 23:09:25,084 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:25,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1142305995, now seen corresponding path program 8 times [2020-10-25 23:09:25,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:25,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286639058] [2020-10-25 23:09:25,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:09:25,201 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:09:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:09:25,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:09:25,550 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 23:09:25,550 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 23:09:25,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 23:09:25,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 11:09:25 BoogieIcfgContainer [2020-10-25 23:09:25,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 23:09:25,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 23:09:25,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 23:09:25,761 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 23:09:25,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:09:15" (3/4) ... [2020-10-25 23:09:25,764 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 23:09:25,956 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 23:09:25,958 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 23:09:25,960 INFO L168 Benchmark]: Toolchain (without parser) took 11359.40 ms. Allocated memory was 39.8 MB in the beginning and 188.7 MB in the end (delta: 148.9 MB). Free memory was 17.7 MB in the beginning and 85.2 MB in the end (delta: -67.5 MB). Peak memory consumption was 83.6 MB. Max. memory is 16.1 GB. [2020-10-25 23:09:25,963 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 39.8 MB. Free memory was 27.0 MB in the beginning and 27.0 MB in the end (delta: 41.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:09:25,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.70 ms. Allocated memory is still 39.8 MB. Free memory was 17.0 MB in the beginning and 17.1 MB in the end (delta: -63.7 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-10-25 23:09:25,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.70 ms. Allocated memory is still 39.8 MB. Free memory was 17.1 MB in the beginning and 15.8 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:09:25,965 INFO L168 Benchmark]: Boogie Preprocessor took 19.64 ms. Allocated memory is still 39.8 MB. Free memory was 15.8 MB in the beginning and 14.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:09:25,965 INFO L168 Benchmark]: RCFGBuilder took 320.79 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 14.7 MB in the beginning and 23.4 MB in the end (delta: -8.7 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:09:25,966 INFO L168 Benchmark]: TraceAbstraction took 10454.11 ms. Allocated memory was 48.2 MB in the beginning and 188.7 MB in the end (delta: 140.5 MB). Free memory was 23.2 MB in the beginning and 104.0 MB in the end (delta: -80.8 MB). Peak memory consumption was 60.5 MB. Max. memory is 16.1 GB. [2020-10-25 23:09:25,968 INFO L168 Benchmark]: Witness Printer took 197.82 ms. Allocated memory is still 188.7 MB. Free memory was 104.0 MB in the beginning and 85.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-10-25 23:09:25,971 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.24 ms. Allocated memory is still 39.8 MB. Free memory was 27.0 MB in the beginning and 27.0 MB in the end (delta: 41.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 316.70 ms. Allocated memory is still 39.8 MB. Free memory was 17.0 MB in the beginning and 17.1 MB in the end (delta: -63.7 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 34.70 ms. Allocated memory is still 39.8 MB. Free memory was 17.1 MB in the beginning and 15.8 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 19.64 ms. Allocated memory is still 39.8 MB. Free memory was 15.8 MB in the beginning and 14.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 320.79 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 14.7 MB in the beginning and 23.4 MB in the end (delta: -8.7 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10454.11 ms. Allocated memory was 48.2 MB in the beginning and 188.7 MB in the end (delta: 140.5 MB). Free memory was 23.2 MB in the beginning and 104.0 MB in the end (delta: -80.8 MB). Peak memory consumption was 60.5 MB. Max. memory is 16.1 GB. * Witness Printer took 197.82 ms. Allocated memory is still 188.7 MB. Free memory was 104.0 MB in the beginning and 85.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: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_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) [L3] __assert_fail("0", "Fibonacci05.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.1s, OverallIterations: 11, TraceHistogramMax: 67, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 163 SDtfs, 429 SDslu, 448 SDs, 0 SdLazy, 1019 SolverSat, 365 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1314 GetRequests, 1175 SyntacticMatches, 3 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 43 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2307 NumberOfCodeBlocks, 2250 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1829 ConstructedInterpolants, 0 QuantifiedInterpolants, 503397 SizeOfPredicates, 43 NumberOfNonLiveVariables, 2124 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 13801/18588 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! Received shutdown request...