./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2c28e4a28eb31322d66c263b5716511ec5353f2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 16:32:02,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 16:32:02,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 16:32:02,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 16:32:02,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 16:32:02,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 16:32:02,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 16:32:02,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 16:32:02,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 16:32:02,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 16:32:02,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 16:32:02,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 16:32:02,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 16:32:02,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 16:32:02,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 16:32:02,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 16:32:02,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 16:32:02,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 16:32:02,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 16:32:02,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 16:32:02,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 16:32:02,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 16:32:02,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 16:32:02,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 16:32:02,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 16:32:02,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 16:32:02,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 16:32:02,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 16:32:02,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 16:32:02,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 16:32:02,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 16:32:02,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 16:32:02,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 16:32:02,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 16:32:02,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 16:32:02,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 16:32:02,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 16:32:02,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 16:32:02,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 16:32:02,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 16:32:02,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 16:32:02,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 16:32:02,637 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 16:32:02,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 16:32:02,638 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 16:32:02,638 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 16:32:02,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 16:32:02,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 16:32:02,640 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 16:32:02,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 16:32:02,640 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 16:32:02,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 16:32:02,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 16:32:02,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 16:32:02,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 16:32:02,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 16:32:02,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 16:32:02,642 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 16:32:02,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 16:32:02,642 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 16:32:02,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 16:32:02,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 16:32:02,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 16:32:02,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 16:32:02,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 16:32:02,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 16:32:02,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 16:32:02,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 16:32:02,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 16:32:02,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 16:32:02,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 16:32:02,644 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 16:32:02,644 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 -> b2c28e4a28eb31322d66c263b5716511ec5353f2 [2021-08-29 16:32:02,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 16:32:02,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 16:32:02,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 16:32:02,895 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 16:32:02,896 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 16:32:02,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2021-08-29 16:32:02,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9bb3b420/5764d88fcd634fa98827e3fbe87d441f/FLAG7056a2bed [2021-08-29 16:32:03,291 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 16:32:03,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2021-08-29 16:32:03,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9bb3b420/5764d88fcd634fa98827e3fbe87d441f/FLAG7056a2bed [2021-08-29 16:32:03,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9bb3b420/5764d88fcd634fa98827e3fbe87d441f [2021-08-29 16:32:03,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 16:32:03,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 16:32:03,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 16:32:03,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 16:32:03,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 16:32:03,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 04:32:03" (1/1) ... [2021-08-29 16:32:03,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a0f51e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:32:03, skipping insertion in model container [2021-08-29 16:32:03,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 04:32:03" (1/1) ... [2021-08-29 16:32:03,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 16:32:03,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 16:32:03,845 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2021-08-29 16:32:03,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 16:32:03,852 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 16:32:03,860 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2021-08-29 16:32:03,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 16:32:03,869 INFO L208 MainTranslator]: Completed translation [2021-08-29 16:32:03,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:32:03 WrapperNode [2021-08-29 16:32:03,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 16:32:03,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 16:32:03,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 16:32:03,871 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 16:32:03,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:32:03" (1/1) ... [2021-08-29 16:32:03,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:32:03" (1/1) ... [2021-08-29 16:32:03,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 16:32:03,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 16:32:03,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 16:32:03,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 16:32:03,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:32:03" (1/1) ... [2021-08-29 16:32:03,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:32:03" (1/1) ... [2021-08-29 16:32:03,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:32:03" (1/1) ... [2021-08-29 16:32:03,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:32:03" (1/1) ... [2021-08-29 16:32:03,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:32:03" (1/1) ... [2021-08-29 16:32:03,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:32:03" (1/1) ... [2021-08-29 16:32:03,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:32:03" (1/1) ... [2021-08-29 16:32:03,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 16:32:03,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 16:32:03,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 16:32:03,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 16:32:03,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:32:03" (1/1) ... [2021-08-29 16:32:03,932 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 16:32:03,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:32:03,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-29 16:32:03,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-29 16:32:03,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 16:32:03,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 16:32:03,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 16:32:03,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 16:32:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-08-29 16:32:03,976 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-08-29 16:32:04,086 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 16:32:04,087 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-29 16:32:04,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:32:04 BoogieIcfgContainer [2021-08-29 16:32:04,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 16:32:04,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 16:32:04,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 16:32:04,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 16:32:04,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 04:32:03" (1/3) ... [2021-08-29 16:32:04,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b69582c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 04:32:04, skipping insertion in model container [2021-08-29 16:32:04,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:32:03" (2/3) ... [2021-08-29 16:32:04,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b69582c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 04:32:04, skipping insertion in model container [2021-08-29 16:32:04,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:32:04" (3/3) ... [2021-08-29 16:32:04,095 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2021-08-29 16:32:04,102 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 16:32:04,102 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-29 16:32:04,144 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 16:32:04,150 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-29 16:32:04,150 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-29 16:32:04,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-29 16:32:04,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-29 16:32:04,173 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:32:04,173 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:32:04,174 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:32:04,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:32:04,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2021-08-29 16:32:04,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:32:04,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240518770] [2021-08-29 16:32:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:32:04,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:32:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:04,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:32:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:32:04,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:32:04,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240518770] [2021-08-29 16:32:04,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240518770] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:32:04,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:32:04,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 16:32:04,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401994592] [2021-08-29 16:32:04,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 16:32:04,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:32:04,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 16:32:04,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:32:04,440 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-29 16:32:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:32:04,528 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2021-08-29 16:32:04,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:32:04,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-29 16:32:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:32:04,534 INFO L225 Difference]: With dead ends: 34 [2021-08-29 16:32:04,535 INFO L226 Difference]: Without dead ends: 18 [2021-08-29 16:32:04,537 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.76ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:32:04,539 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.43ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71.44ms IncrementalHoareTripleChecker+Time [2021-08-29 16:32:04,540 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 24 Invalid, 67 Unknown, 0 Unchecked, 1.43ms Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 71.44ms Time] [2021-08-29 16:32:04,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-08-29 16:32:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-08-29 16:32:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-29 16:32:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-29 16:32:04,562 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-08-29 16:32:04,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:32:04,563 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-29 16:32:04,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-29 16:32:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-29 16:32:04,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-29 16:32:04,564 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:32:04,564 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:32:04,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 16:32:04,565 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:32:04,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:32:04,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2021-08-29 16:32:04,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:32:04,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669405370] [2021-08-29 16:32:04,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:32:04,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:32:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:04,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:32:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:32:04,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:32:04,607 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669405370] [2021-08-29 16:32:04,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669405370] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:32:04,607 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:32:04,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 16:32:04,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188360571] [2021-08-29 16:32:04,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 16:32:04,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:32:04,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 16:32:04,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:32:04,610 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-29 16:32:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:32:04,655 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-08-29 16:32:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:32:04,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-29 16:32:04,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:32:04,656 INFO L225 Difference]: With dead ends: 24 [2021-08-29 16:32:04,656 INFO L226 Difference]: Without dead ends: 20 [2021-08-29 16:32:04,657 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.35ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:32:04,658 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.09ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.23ms IncrementalHoareTripleChecker+Time [2021-08-29 16:32:04,658 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 54 Unknown, 0 Unchecked, 1.09ms Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 40.23ms Time] [2021-08-29 16:32:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-29 16:32:04,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-08-29 16:32:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-29 16:32:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-29 16:32:04,662 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-08-29 16:32:04,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:32:04,662 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-29 16:32:04,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-29 16:32:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-29 16:32:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-29 16:32:04,664 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:32:04,665 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:32:04,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 16:32:04,665 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:32:04,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:32:04,665 INFO L82 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2021-08-29 16:32:04,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:32:04,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198830115] [2021-08-29 16:32:04,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:32:04,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:32:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:04,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:32:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:04,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:04,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-29 16:32:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-29 16:32:04,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:32:04,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198830115] [2021-08-29 16:32:04,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198830115] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:32:04,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069767587] [2021-08-29 16:32:04,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:32:04,766 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:32:04,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:32:04,769 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 16:32:04,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-29 16:32:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:04,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-29 16:32:04,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:32:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-29 16:32:04,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:32:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-29 16:32:05,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069767587] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:32:05,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:32:05,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2021-08-29 16:32:05,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791123700] [2021-08-29 16:32:05,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-29 16:32:05,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:32:05,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-29 16:32:05,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-08-29 16:32:05,191 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-29 16:32:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:32:05,298 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-08-29 16:32:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 16:32:05,299 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2021-08-29 16:32:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:32:05,301 INFO L225 Difference]: With dead ends: 35 [2021-08-29 16:32:05,302 INFO L226 Difference]: Without dead ends: 20 [2021-08-29 16:32:05,306 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 90.32ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-08-29 16:32:05,309 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 41 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.27ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.22ms IncrementalHoareTripleChecker+Time [2021-08-29 16:32:05,310 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 5 Invalid, 135 Unknown, 0 Unchecked, 4.27ms Time], IncrementalHoareTripleChecker [27 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 65.22ms Time] [2021-08-29 16:32:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-29 16:32:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-08-29 16:32:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-29 16:32:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-08-29 16:32:05,316 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-08-29 16:32:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:32:05,316 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-08-29 16:32:05,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-29 16:32:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-08-29 16:32:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-29 16:32:05,317 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:32:05,317 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:32:05,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-29 16:32:05,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:32:05,525 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:32:05,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:32:05,526 INFO L82 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2021-08-29 16:32:05,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:32:05,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310551028] [2021-08-29 16:32:05,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:32:05,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:32:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:05,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:32:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:05,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:05,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:32:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 16:32:05,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:32:05,607 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310551028] [2021-08-29 16:32:05,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310551028] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:32:05,607 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513308242] [2021-08-29 16:32:05,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:32:05,608 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:32:05,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:32:05,613 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 16:32:05,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-29 16:32:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:05,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-29 16:32:05,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:32:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 16:32:05,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:32:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-29 16:32:05,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513308242] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:32:05,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:32:05,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2021-08-29 16:32:05,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39421616] [2021-08-29 16:32:05,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-29 16:32:05,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:32:05,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-29 16:32:05,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-08-29 16:32:05,905 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-29 16:32:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:32:05,987 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-08-29 16:32:05,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 16:32:05,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2021-08-29 16:32:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:32:05,991 INFO L225 Difference]: With dead ends: 38 [2021-08-29 16:32:05,992 INFO L226 Difference]: Without dead ends: 34 [2021-08-29 16:32:05,994 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 45.19ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-08-29 16:32:05,998 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.84ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.25ms IncrementalHoareTripleChecker+Time [2021-08-29 16:32:05,999 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 6 Invalid, 148 Unknown, 0 Unchecked, 1.84ms Time], IncrementalHoareTripleChecker [11 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 64.25ms Time] [2021-08-29 16:32:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-08-29 16:32:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-08-29 16:32:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2021-08-29 16:32:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-08-29 16:32:06,010 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-08-29 16:32:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:32:06,010 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-08-29 16:32:06,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-29 16:32:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-08-29 16:32:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-29 16:32:06,012 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:32:06,012 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:32:06,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-29 16:32:06,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-08-29 16:32:06,229 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:32:06,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:32:06,229 INFO L82 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2021-08-29 16:32:06,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:32:06,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545105494] [2021-08-29 16:32:06,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:32:06,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:32:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:06,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:32:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:06,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:06,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:06,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:32:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:06,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:32:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-29 16:32:06,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:32:06,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545105494] [2021-08-29 16:32:06,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545105494] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:32:06,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343725752] [2021-08-29 16:32:06,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 16:32:06,347 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:32:06,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:32:06,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 16:32:06,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-29 16:32:06,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 16:32:06,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 16:32:06,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-29 16:32:06,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:32:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-29 16:32:06,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:32:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-08-29 16:32:06,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343725752] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:32:06,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:32:06,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2021-08-29 16:32:06,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687413616] [2021-08-29 16:32:06,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-29 16:32:06,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:32:06,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-29 16:32:06,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-08-29 16:32:06,753 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2021-08-29 16:32:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:32:06,920 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2021-08-29 16:32:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-29 16:32:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2021-08-29 16:32:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:32:06,922 INFO L225 Difference]: With dead ends: 69 [2021-08-29 16:32:06,922 INFO L226 Difference]: Without dead ends: 38 [2021-08-29 16:32:06,922 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 126.15ms TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2021-08-29 16:32:06,923 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 57 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.56ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 103.58ms IncrementalHoareTripleChecker+Time [2021-08-29 16:32:06,923 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 5 Invalid, 246 Unknown, 0 Unchecked, 1.56ms Time], IncrementalHoareTripleChecker [52 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 103.58ms Time] [2021-08-29 16:32:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-08-29 16:32:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-08-29 16:32:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2021-08-29 16:32:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-08-29 16:32:06,927 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2021-08-29 16:32:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:32:06,927 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-08-29 16:32:06,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2021-08-29 16:32:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-08-29 16:32:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-29 16:32:06,929 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:32:06,929 INFO L513 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:32:06,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-08-29 16:32:07,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:32:07,146 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:32:07,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:32:07,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2021-08-29 16:32:07,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:32:07,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156593312] [2021-08-29 16:32:07,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:32:07,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:32:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:07,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:32:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:07,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:07,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:07,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:07,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:32:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:07,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:32:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:07,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:32:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:07,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:07,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:32:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-08-29 16:32:07,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:32:07,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156593312] [2021-08-29 16:32:07,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156593312] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:32:07,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301576464] [2021-08-29 16:32:07,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-29 16:32:07,284 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:32:07,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:32:07,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 16:32:07,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-29 16:32:07,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-08-29 16:32:07,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 16:32:07,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-29 16:32:07,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:32:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-08-29 16:32:07,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:32:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-08-29 16:32:07,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301576464] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:32:07,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:32:07,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 17 [2021-08-29 16:32:07,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401167920] [2021-08-29 16:32:07,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-29 16:32:07,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:32:07,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-29 16:32:07,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-08-29 16:32:07,731 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2021-08-29 16:32:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:32:07,851 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2021-08-29 16:32:07,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-29 16:32:07,852 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) Word has length 65 [2021-08-29 16:32:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:32:07,853 INFO L225 Difference]: With dead ends: 85 [2021-08-29 16:32:07,853 INFO L226 Difference]: Without dead ends: 50 [2021-08-29 16:32:07,854 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 85.89ms TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-08-29 16:32:07,854 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 75 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.30ms SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 94.70ms IncrementalHoareTripleChecker+Time [2021-08-29 16:32:07,854 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 7 Invalid, 229 Unknown, 0 Unchecked, 1.30ms Time], IncrementalHoareTripleChecker [57 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 94.70ms Time] [2021-08-29 16:32:07,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-29 16:32:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2021-08-29 16:32:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2021-08-29 16:32:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2021-08-29 16:32:07,865 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2021-08-29 16:32:07,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:32:07,868 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2021-08-29 16:32:07,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2021-08-29 16:32:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2021-08-29 16:32:07,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-29 16:32:07,874 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:32:07,874 INFO L513 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:32:07,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-29 16:32:08,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:32:08,089 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:32:08,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:32:08,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2021-08-29 16:32:08,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:32:08,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175504923] [2021-08-29 16:32:08,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:32:08,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:32:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:32:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:32:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:32:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:32:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:32:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:32:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:32:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:32:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:32:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:32:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:32:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-08-29 16:32:08,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:32:08,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175504923] [2021-08-29 16:32:08,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175504923] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:32:08,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778164009] [2021-08-29 16:32:08,352 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-29 16:32:08,352 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:32:08,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:32:08,353 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 16:32:08,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-29 16:32:08,419 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-29 16:32:08,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 16:32:08,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-29 16:32:08,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:32:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-08-29 16:32:08,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:32:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 403 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2021-08-29 16:32:09,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778164009] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:32:09,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:32:09,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13] total 20 [2021-08-29 16:32:09,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327865319] [2021-08-29 16:32:09,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-29 16:32:09,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:32:09,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-29 16:32:09,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-08-29 16:32:09,392 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2021-08-29 16:32:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:32:09,603 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2021-08-29 16:32:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-29 16:32:09,604 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) Word has length 147 [2021-08-29 16:32:09,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:32:09,610 INFO L225 Difference]: With dead ends: 117 [2021-08-29 16:32:09,610 INFO L226 Difference]: Without dead ends: 113 [2021-08-29 16:32:09,611 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 83.17ms TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2021-08-29 16:32:09,612 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 132 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 136.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.08ms SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 178.76ms IncrementalHoareTripleChecker+Time [2021-08-29 16:32:09,612 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 7 Invalid, 357 Unknown, 0 Unchecked, 4.08ms Time], IncrementalHoareTripleChecker [168 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 178.76ms Time] [2021-08-29 16:32:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-08-29 16:32:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2021-08-29 16:32:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 68 states have internal predecessors, (82), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (56), 26 states have call predecessors, (56), 21 states have call successors, (56) [2021-08-29 16:32:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2021-08-29 16:32:09,635 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2021-08-29 16:32:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:32:09,635 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2021-08-29 16:32:09,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2021-08-29 16:32:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2021-08-29 16:32:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-08-29 16:32:09,637 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:32:09,637 INFO L513 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:32:09,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-29 16:32:09,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:32:09,838 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:32:09,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:32:09,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2021-08-29 16:32:09,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:32:09,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477632246] [2021-08-29 16:32:09,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:32:09,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:32:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:09,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:32:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:09,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:09,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:32:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:32:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:32:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:32:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:32:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:32:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:32:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:32:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:32:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:32:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:32:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:32:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:32:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:32:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:32:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:32:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:32:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2021-08-29 16:32:10,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:32:10,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477632246] [2021-08-29 16:32:10,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477632246] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:32:10,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030899115] [2021-08-29 16:32:10,261 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-29 16:32:10,261 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:32:10,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:32:10,265 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 16:32:10,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-29 16:32:10,347 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-08-29 16:32:10,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 16:32:10,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-29 16:32:10,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:32:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2021-08-29 16:32:10,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:32:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 632 proven. 605 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2021-08-29 16:32:12,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030899115] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:32:12,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:32:12,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 21] total 34 [2021-08-29 16:32:12,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636657698] [2021-08-29 16:32:12,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-29 16:32:12,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:32:12,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-29 16:32:12,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2021-08-29 16:32:12,238 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) [2021-08-29 16:32:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:32:12,701 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2021-08-29 16:32:12,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-29 16:32:12,702 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) Word has length 215 [2021-08-29 16:32:12,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:32:12,704 INFO L225 Difference]: With dead ends: 193 [2021-08-29 16:32:12,705 INFO L226 Difference]: Without dead ends: 95 [2021-08-29 16:32:12,708 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 473 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 381.20ms TimeCoverageRelationStatistics Valid=650, Invalid=2002, Unknown=0, NotChecked=0, Total=2652 [2021-08-29 16:32:12,709 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 203 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 223.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.38ms SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 298.97ms IncrementalHoareTripleChecker+Time [2021-08-29 16:32:12,709 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 10 Invalid, 758 Unknown, 0 Unchecked, 4.38ms Time], IncrementalHoareTripleChecker [240 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 298.97ms Time] [2021-08-29 16:32:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-29 16:32:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2021-08-29 16:32:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 58 states have internal predecessors, (62), 15 states have call successors, (15), 12 states have call predecessors, (15), 8 states have return successors, (36), 13 states have call predecessors, (36), 15 states have call successors, (36) [2021-08-29 16:32:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2021-08-29 16:32:12,728 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2021-08-29 16:32:12,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:32:12,728 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-08-29 16:32:12,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) [2021-08-29 16:32:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2021-08-29 16:32:12,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-08-29 16:32:12,733 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:32:12,733 INFO L513 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:32:12,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-29 16:32:12,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:32:12,955 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:32:12,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:32:12,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 6 times [2021-08-29 16:32:12,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:32:12,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945487905] [2021-08-29 16:32:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:32:12,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:32:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 16:32:12,983 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 16:32:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 16:32:13,050 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 16:32:13,050 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 16:32:13,051 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-08-29 16:32:13,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-29 16:32:13,057 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 16:32:13,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 04:32:13 BoogieIcfgContainer [2021-08-29 16:32:13,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 16:32:13,142 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 16:32:13,142 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 16:32:13,142 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 16:32:13,143 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:32:04" (3/4) ... [2021-08-29 16:32:13,144 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 16:32:13,219 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 16:32:13,219 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 16:32:13,219 INFO L158 Benchmark]: Toolchain (without parser) took 9474.24ms. Allocated memory was 52.4MB in the beginning and 111.1MB in the end (delta: 58.7MB). Free memory was 29.3MB in the beginning and 37.8MB in the end (delta: -8.4MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2021-08-29 16:32:13,220 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory is still 33.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 16:32:13,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 117.02ms. Allocated memory is still 52.4MB. Free memory was 29.1MB in the beginning and 19.9MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-29 16:32:13,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.42ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 19.9MB in the beginning and 46.6MB in the end (delta: -26.7MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2021-08-29 16:32:13,220 INFO L158 Benchmark]: Boogie Preprocessor took 26.61ms. Allocated memory is still 62.9MB. Free memory was 46.6MB in the beginning and 45.6MB in the end (delta: 950.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 16:32:13,220 INFO L158 Benchmark]: RCFGBuilder took 161.06ms. Allocated memory is still 62.9MB. Free memory was 45.6MB in the beginning and 37.4MB in the end (delta: 8.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-08-29 16:32:13,220 INFO L158 Benchmark]: TraceAbstraction took 9052.12ms. Allocated memory was 62.9MB in the beginning and 111.1MB in the end (delta: 48.2MB). Free memory was 36.7MB in the beginning and 49.3MB in the end (delta: -12.6MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2021-08-29 16:32:13,221 INFO L158 Benchmark]: Witness Printer took 76.80ms. Allocated memory is still 111.1MB. Free memory was 49.3MB in the beginning and 37.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-29 16:32:13,222 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory is still 33.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 117.02ms. Allocated memory is still 52.4MB. Free memory was 29.1MB in the beginning and 19.9MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.42ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 19.9MB in the beginning and 46.6MB in the end (delta: -26.7MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.61ms. Allocated memory is still 62.9MB. Free memory was 46.6MB in the beginning and 45.6MB in the end (delta: 950.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 161.06ms. Allocated memory is still 62.9MB. Free memory was 45.6MB in the beginning and 37.4MB in the end (delta: 8.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9052.12ms. Allocated memory was 62.9MB in the beginning and 111.1MB in the end (delta: 48.2MB). Free memory was 36.7MB in the beginning and 49.3MB in the end (delta: -12.6MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. * Witness Printer took 76.80ms. Allocated memory is still 111.1MB. Free memory was 49.3MB in the beginning and 37.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 7; [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 13 [L29] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8912.74ms, OverallIterations: 9, TraceHistogramMax: 41, EmptinessCheckTime: 27.34ms, AutomataDifference: 1375.75ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 11.15ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 577 SdHoareTripleChecker+Valid, 917.15ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 533 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 694.44ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 513 mSDsCounter, 555 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1439 IncrementalHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 555 mSolverCounterUnsat, 45 mSDtfsCounter, 1439 mSolverCounterSat, 19.96ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1269 GetRequests, 1121 SyntacticMatches, 11 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 865.03ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=7, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 85.99ms AutomataMinimizationTime, 8 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 70.44ms SsaConstructionTime, 265.44ms SatisfiabilityAnalysisTime, 5428.31ms InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1240 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1534 ConstructedInterpolants, 0 QuantifiedInterpolants, 2970 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1048 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 8721/11991 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-29 16:32:13,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...