./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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/Fibonacci04.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 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 04:20:00,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 04:20:00,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 04:20:00,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 04:20:00,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 04:20:00,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 04:20:00,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 04:20:00,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 04:20:00,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 04:20:00,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 04:20:00,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 04:20:00,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 04:20:00,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 04:20:00,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 04:20:00,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 04:20:00,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 04:20:00,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 04:20:00,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 04:20:00,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 04:20:00,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 04:20:00,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 04:20:00,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 04:20:00,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 04:20:00,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 04:20:00,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 04:20:00,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 04:20:00,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 04:20:00,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 04:20:00,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 04:20:00,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 04:20:00,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 04:20:00,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 04:20:00,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 04:20:00,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 04:20:00,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 04:20:00,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 04:20:00,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 04:20:00,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 04:20:00,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 04:20:00,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 04:20:00,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 04:20:00,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 04:20:00,986 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 04:20:00,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 04:20:00,987 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 04:20:00,987 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 04:20:00,987 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 04:20:00,987 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 04:20:00,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 04:20:00,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 04:20:00,988 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 04:20:00,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 04:20:00,988 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 04:20:00,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 04:20:00,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 04:20:00,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 04:20:00,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 04:20:00,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 04:20:00,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 04:20:00,991 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 04:20:00,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 04:20:00,991 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 04:20:00,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 04:20:00,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 04:20:00,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 04:20:00,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 04:20:00,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 04:20:00,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 04:20:00,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 04:20:00,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 04:20:00,992 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 04:20:00,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 04:20:00,993 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 04:20:00,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 04:20:00,993 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 04:20:00,993 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 04:20:00,993 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 04:20:00,993 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 [2023-02-18 04:20:01,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 04:20:01,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 04:20:01,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 04:20:01,231 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 04:20:01,231 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 04:20:01,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci04.c [2023-02-18 04:20:02,285 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 04:20:02,414 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 04:20:02,414 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c [2023-02-18 04:20:02,418 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a147d151/7c2792298c974478a0f148bd1139d028/FLAG878dad535 [2023-02-18 04:20:02,427 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a147d151/7c2792298c974478a0f148bd1139d028 [2023-02-18 04:20:02,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 04:20:02,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 04:20:02,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 04:20:02,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 04:20:02,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 04:20:02,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:20:02" (1/1) ... [2023-02-18 04:20:02,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66aa2c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:20:02, skipping insertion in model container [2023-02-18 04:20:02,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:20:02" (1/1) ... [2023-02-18 04:20:02,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 04:20:02,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 04:20:02,553 WARN L237 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/Fibonacci04.c[780,793] [2023-02-18 04:20:02,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 04:20:02,565 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 04:20:02,573 WARN L237 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/Fibonacci04.c[780,793] [2023-02-18 04:20:02,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 04:20:02,581 INFO L208 MainTranslator]: Completed translation [2023-02-18 04:20:02,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:20:02 WrapperNode [2023-02-18 04:20:02,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 04:20:02,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 04:20:02,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 04:20:02,582 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 04:20:02,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:20:02" (1/1) ... [2023-02-18 04:20:02,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:20:02" (1/1) ... [2023-02-18 04:20:02,603 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2023-02-18 04:20:02,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 04:20:02,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 04:20:02,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 04:20:02,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 04:20:02,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:20:02" (1/1) ... [2023-02-18 04:20:02,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:20:02" (1/1) ... [2023-02-18 04:20:02,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:20:02" (1/1) ... [2023-02-18 04:20:02,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:20:02" (1/1) ... [2023-02-18 04:20:02,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:20:02" (1/1) ... [2023-02-18 04:20:02,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:20:02" (1/1) ... [2023-02-18 04:20:02,613 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:20:02" (1/1) ... [2023-02-18 04:20:02,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:20:02" (1/1) ... [2023-02-18 04:20:02,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 04:20:02,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 04:20:02,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 04:20:02,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 04:20:02,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:20:02" (1/1) ... [2023-02-18 04:20:02,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 04:20:02,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:20:02,633 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) [2023-02-18 04:20:02,637 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 [2023-02-18 04:20:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-02-18 04:20:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-02-18 04:20:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 04:20:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 04:20:02,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 04:20:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 04:20:02,695 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 04:20:02,696 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 04:20:02,800 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 04:20:02,804 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 04:20:02,805 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-18 04:20:02,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:20:02 BoogieIcfgContainer [2023-02-18 04:20:02,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 04:20:02,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 04:20:02,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 04:20:02,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 04:20:02,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 04:20:02" (1/3) ... [2023-02-18 04:20:02,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcae0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:20:02, skipping insertion in model container [2023-02-18 04:20:02,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:20:02" (2/3) ... [2023-02-18 04:20:02,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcae0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:20:02, skipping insertion in model container [2023-02-18 04:20:02,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:20:02" (3/3) ... [2023-02-18 04:20:02,813 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2023-02-18 04:20:02,825 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 04:20:02,825 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 04:20:02,864 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 04:20:02,869 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7fa7221e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 04:20:02,870 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 04:20:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 04:20:02,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-18 04:20:02,879 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:20:02,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:20:02,880 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:20:02,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:20:02,885 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2023-02-18 04:20:02,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:20:02,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204450074] [2023-02-18 04:20:02,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:20:02,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:20:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:03,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:20:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 04:20:03,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:20:03,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204450074] [2023-02-18 04:20:03,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204450074] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:20:03,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:20:03,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 04:20:03,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059938016] [2023-02-18 04:20:03,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:20:03,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 04:20:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:20:03,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 04:20:03,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 04:20:03,128 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 04:20:03,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:20:03,193 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-02-18 04:20:03,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 04:20:03,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-02-18 04:20:03,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:20:03,200 INFO L225 Difference]: With dead ends: 31 [2023-02-18 04:20:03,200 INFO L226 Difference]: Without dead ends: 18 [2023-02-18 04:20:03,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:20:03,219 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:20:03,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 40 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:20:03,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-18 04:20:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-18 04:20:03,258 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) [2023-02-18 04:20:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-02-18 04:20:03,260 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-02-18 04:20:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:20:03,260 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-18 04:20:03,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 04:20:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-02-18 04:20:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 04:20:03,261 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:20:03,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:20:03,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 04:20:03,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:20:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:20:03,273 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2023-02-18 04:20:03,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:20:03,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488110080] [2023-02-18 04:20:03,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:20:03,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:20:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:03,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:20:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 04:20:03,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:20:03,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488110080] [2023-02-18 04:20:03,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488110080] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:20:03,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:20:03,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 04:20:03,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302412583] [2023-02-18 04:20:03,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:20:03,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 04:20:03,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:20:03,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 04:20:03,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 04:20:03,368 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 04:20:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:20:03,413 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2023-02-18 04:20:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 04:20:03,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-02-18 04:20:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:20:03,414 INFO L225 Difference]: With dead ends: 24 [2023-02-18 04:20:03,414 INFO L226 Difference]: Without dead ends: 20 [2023-02-18 04:20:03,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:20:03,416 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:20:03,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:20:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-18 04:20:03,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2023-02-18 04:20:03,423 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) [2023-02-18 04:20:03,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-02-18 04:20:03,424 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2023-02-18 04:20:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:20:03,424 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-18 04:20:03,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 04:20:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-02-18 04:20:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 04:20:03,427 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:20:03,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:20:03,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 04:20:03,428 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:20:03,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:20:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2023-02-18 04:20:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:20:03,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205272126] [2023-02-18 04:20:03,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:20:03,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:20:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:03,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:20:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:03,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:03,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 04:20:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:20:03,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:20:03,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205272126] [2023-02-18 04:20:03,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205272126] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:20:03,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550621757] [2023-02-18 04:20:03,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:20:03,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:20:03,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:20:03,579 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) [2023-02-18 04:20:03,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 04:20:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:03,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 04:20:03,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:20:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:20:03,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:20:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-18 04:20:03,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550621757] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:20:03,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:20:03,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-02-18 04:20:03,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003935792] [2023-02-18 04:20:03,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:20:03,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 04:20:03,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:20:03,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 04:20:03,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-02-18 04:20:03,814 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-18 04:20:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:20:03,949 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2023-02-18 04:20:03,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 04:20:03,950 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2023-02-18 04:20:03,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:20:03,951 INFO L225 Difference]: With dead ends: 46 [2023-02-18 04:20:03,951 INFO L226 Difference]: Without dead ends: 29 [2023-02-18 04:20:03,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-02-18 04:20:03,952 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:20:03,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 63 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:20:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-18 04:20:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-18 04:20:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-02-18 04:20:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2023-02-18 04:20:03,958 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2023-02-18 04:20:03,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:20:03,958 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2023-02-18 04:20:03,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-18 04:20:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2023-02-18 04:20:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 04:20:03,960 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:20:03,960 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:20:03,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 04:20:04,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:20:04,167 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:20:04,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:20:04,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2023-02-18 04:20:04,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:20:04,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832846329] [2023-02-18 04:20:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:20:04,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:20:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:04,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:20:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:04,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:04,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:04,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:20:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:04,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:20:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:04,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:04,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:20:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:04,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:04,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:20:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-02-18 04:20:04,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:20:04,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832846329] [2023-02-18 04:20:04,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832846329] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:20:04,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481960764] [2023-02-18 04:20:04,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:20:04,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:20:04,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:20:04,489 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) [2023-02-18 04:20:04,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 04:20:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:04,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 04:20:04,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:20:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-02-18 04:20:04,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:20:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 04:20:04,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481960764] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:20:04,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:20:04,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2023-02-18 04:20:04,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448385918] [2023-02-18 04:20:04,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:20:04,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 04:20:04,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:20:04,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 04:20:04,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-02-18 04:20:04,702 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-18 04:20:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:20:04,831 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2023-02-18 04:20:04,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 04:20:04,833 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 65 [2023-02-18 04:20:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:20:04,838 INFO L225 Difference]: With dead ends: 73 [2023-02-18 04:20:04,838 INFO L226 Difference]: Without dead ends: 44 [2023-02-18 04:20:04,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 134 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2023-02-18 04:20:04,842 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:20:04,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 93 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:20:04,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-18 04:20:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-18 04:20:04,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (19), 9 states have call predecessors, (19), 7 states have call successors, (19) [2023-02-18 04:20:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2023-02-18 04:20:04,854 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 65 [2023-02-18 04:20:04,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:20:04,854 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2023-02-18 04:20:04,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-18 04:20:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2023-02-18 04:20:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-02-18 04:20:04,857 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:20:04,857 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 14, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:20:04,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 04:20:05,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-18 04:20:05,062 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:20:05,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:20:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash -878098806, now seen corresponding path program 2 times [2023-02-18 04:20:05,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:20:05,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52916399] [2023-02-18 04:20:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:20:05,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:20:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:20:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:20:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:20:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-18 04:20:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:20:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 04:20:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:20:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:20:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-18 04:20:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:20:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 04:20:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 100 proven. 219 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2023-02-18 04:20:05,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:20:05,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52916399] [2023-02-18 04:20:05,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52916399] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:20:05,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742143325] [2023-02-18 04:20:05,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 04:20:05,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:20:05,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:20:05,341 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) [2023-02-18 04:20:05,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 04:20:05,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 04:20:05,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:20:05,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 04:20:05,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:20:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 79 proven. 263 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2023-02-18 04:20:05,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:20:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 79 proven. 275 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2023-02-18 04:20:05,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742143325] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:20:05,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:20:05,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 17 [2023-02-18 04:20:05,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509353764] [2023-02-18 04:20:05,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:20:05,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 04:20:05,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:20:05,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 04:20:05,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-02-18 04:20:05,568 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-18 04:20:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:20:05,706 INFO L93 Difference]: Finished difference Result 101 states and 150 transitions. [2023-02-18 04:20:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 04:20:05,707 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Word has length 144 [2023-02-18 04:20:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:20:05,708 INFO L225 Difference]: With dead ends: 101 [2023-02-18 04:20:05,708 INFO L226 Difference]: Without dead ends: 60 [2023-02-18 04:20:05,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 315 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2023-02-18 04:20:05,709 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:20:05,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 94 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:20:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-18 04:20:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2023-02-18 04:20:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2023-02-18 04:20:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2023-02-18 04:20:05,714 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 144 [2023-02-18 04:20:05,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:20:05,715 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2023-02-18 04:20:05,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-18 04:20:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2023-02-18 04:20:05,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-02-18 04:20:05,716 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:20:05,716 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:20:05,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 04:20:05,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:20:05,921 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:20:05,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:20:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1511331526, now seen corresponding path program 3 times [2023-02-18 04:20:05,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:20:05,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076897798] [2023-02-18 04:20:05,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:20:05,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:20:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:20:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:20:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:20:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:20:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:20:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:20:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:20:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:20:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:20:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:20:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:20:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:20:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:20:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 320 proven. 96 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2023-02-18 04:20:06,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:20:06,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076897798] [2023-02-18 04:20:06,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076897798] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:20:06,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550420901] [2023-02-18 04:20:06,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 04:20:06,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:20:06,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:20:06,371 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) [2023-02-18 04:20:06,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 04:20:06,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-02-18 04:20:06,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:20:06,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 04:20:06,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:20:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 340 proven. 33 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2023-02-18 04:20:06,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:20:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 340 proven. 34 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2023-02-18 04:20:06,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550420901] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:20:06,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:20:06,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 18 [2023-02-18 04:20:06,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760485551] [2023-02-18 04:20:06,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:20:06,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 04:20:06,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:20:06,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 04:20:06,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2023-02-18 04:20:06,614 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) [2023-02-18 04:20:06,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:20:06,757 INFO L93 Difference]: Finished difference Result 101 states and 160 transitions. [2023-02-18 04:20:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 04:20:06,757 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) Word has length 147 [2023-02-18 04:20:06,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:20:06,758 INFO L225 Difference]: With dead ends: 101 [2023-02-18 04:20:06,759 INFO L226 Difference]: Without dead ends: 49 [2023-02-18 04:20:06,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 321 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2023-02-18 04:20:06,760 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:20:06,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 121 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:20:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-18 04:20:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-02-18 04:20:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 33 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-18 04:20:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2023-02-18 04:20:06,765 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 147 [2023-02-18 04:20:06,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:20:06,766 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2023-02-18 04:20:06,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) [2023-02-18 04:20:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2023-02-18 04:20:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-02-18 04:20:06,767 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:20:06,767 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:20:06,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 04:20:06,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:20:06,970 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:20:06,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:20:06,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2094125593, now seen corresponding path program 4 times [2023-02-18 04:20:06,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:20:06,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378277574] [2023-02-18 04:20:06,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:20:06,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:20:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 04:20:06,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 04:20:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 04:20:07,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 04:20:07,019 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 04:20:07,020 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 04:20:07,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 04:20:07,023 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-02-18 04:20:07,027 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 04:20:07,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 04:20:07 BoogieIcfgContainer [2023-02-18 04:20:07,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 04:20:07,067 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 04:20:07,067 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 04:20:07,067 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 04:20:07,067 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:20:02" (3/4) ... [2023-02-18 04:20:07,069 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-18 04:20:07,103 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 04:20:07,103 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 04:20:07,103 INFO L158 Benchmark]: Toolchain (without parser) took 4673.96ms. Allocated memory was 121.6MB in the beginning and 182.5MB in the end (delta: 60.8MB). Free memory was 85.7MB in the beginning and 62.0MB in the end (delta: 23.8MB). Peak memory consumption was 87.1MB. Max. memory is 16.1GB. [2023-02-18 04:20:07,103 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 94.4MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:20:07,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.20ms. Allocated memory is still 121.6MB. Free memory was 85.3MB in the beginning and 75.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 04:20:07,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.71ms. Allocated memory is still 121.6MB. Free memory was 75.3MB in the beginning and 74.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 04:20:07,104 INFO L158 Benchmark]: Boogie Preprocessor took 9.87ms. Allocated memory is still 121.6MB. Free memory was 74.1MB in the beginning and 73.2MB in the end (delta: 952.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:20:07,104 INFO L158 Benchmark]: RCFGBuilder took 191.66ms. Allocated memory is still 121.6MB. Free memory was 73.2MB in the beginning and 63.6MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 04:20:07,105 INFO L158 Benchmark]: TraceAbstraction took 4259.14ms. Allocated memory was 121.6MB in the beginning and 182.5MB in the end (delta: 60.8MB). Free memory was 63.2MB in the beginning and 65.1MB in the end (delta: -2.0MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2023-02-18 04:20:07,105 INFO L158 Benchmark]: Witness Printer took 36.24ms. Allocated memory is still 182.5MB. Free memory was 65.1MB in the beginning and 62.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 04:20:07,106 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.54ms. Allocated memory is still 94.4MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 151.20ms. Allocated memory is still 121.6MB. Free memory was 85.3MB in the beginning and 75.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.71ms. Allocated memory is still 121.6MB. Free memory was 75.3MB in the beginning and 74.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 9.87ms. Allocated memory is still 121.6MB. Free memory was 74.1MB in the beginning and 73.2MB in the end (delta: 952.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 191.66ms. Allocated memory is still 121.6MB. Free memory was 73.2MB in the beginning and 63.6MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4259.14ms. Allocated memory was 121.6MB in the beginning and 182.5MB in the end (delta: 60.8MB). Free memory was 63.2MB in the beginning and 65.1MB in the end (delta: -2.0MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. * Witness Printer took 36.24ms. Allocated memory is still 182.5MB. Free memory was 65.1MB in the beginning and 62.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); [L31] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L19] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L21] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L21] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L24] return fibonacci(n-1) + fibonacci(n-2); [L31] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L31] int result = fibonacci(x); [L32] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L35] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 443 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 339 mSDsCounter, 169 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 725 IncrementalHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 169 mSolverCounterUnsat, 104 mSDtfsCounter, 725 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 941 GetRequests, 821 SyntacticMatches, 29 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=6, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 885 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 2160 SizeOfPredicates, 20 NumberOfNonLiveVariables, 813 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 6248/7404 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! [2023-02-18 04:20:07,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE