./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:38:18,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:38:18,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:38:18,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:38:18,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:38:18,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:38:18,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:38:18,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:38:18,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:38:18,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:38:18,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:38:18,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:38:18,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:38:18,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:38:18,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:38:18,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:38:18,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:38:18,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:38:18,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:38:18,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:38:18,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:38:18,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:38:18,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:38:18,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:38:18,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:38:18,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:38:18,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:38:18,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:38:18,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:38:18,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:38:18,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:38:18,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:38:18,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:38:18,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:38:18,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:38:18,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:38:18,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:38:18,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:38:18,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:38:18,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:38:18,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:38:18,384 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 21:38:18,398 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:38:18,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:38:18,398 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:38:18,398 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:38:18,399 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:38:18,399 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:38:18,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:38:18,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:38:18,400 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:38:18,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:38:18,400 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:38:18,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:38:18,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:38:18,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:38:18,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 21:38:18,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:38:18,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 21:38:18,401 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:38:18,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 21:38:18,402 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:38:18,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 21:38:18,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:38:18,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:38:18,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:38:18,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:38:18,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:38:18,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:38:18,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 21:38:18,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 21:38:18,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 21:38:18,403 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:38:18,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 21:38:18,404 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:38:18,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:38:18,404 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:38:18,404 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 -> ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db [2023-02-15 21:38:18,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:38:18,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:38:18,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:38:18,620 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:38:18,620 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:38:18,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2023-02-15 21:38:19,656 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:38:19,825 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:38:19,827 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2023-02-15 21:38:19,831 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b977d3a4a/295ae15aecaa4068a676377bd952a0a9/FLAGa95832185 [2023-02-15 21:38:19,844 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b977d3a4a/295ae15aecaa4068a676377bd952a0a9 [2023-02-15 21:38:19,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:38:19,847 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:38:19,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:38:19,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:38:19,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:38:19,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:38:19" (1/1) ... [2023-02-15 21:38:19,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ba0f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:38:19, skipping insertion in model container [2023-02-15 21:38:19,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:38:19" (1/1) ... [2023-02-15 21:38:19,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:38:19,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:38:19,967 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-simple/fibo_2calls_10-2.c[949,962] [2023-02-15 21:38:19,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:38:19,986 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 21:38:20,002 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-simple/fibo_2calls_10-2.c[949,962] [2023-02-15 21:38:20,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:38:20,013 INFO L208 MainTranslator]: Completed translation [2023-02-15 21:38:20,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:38:20 WrapperNode [2023-02-15 21:38:20,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:38:20,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 21:38:20,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 21:38:20,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 21:38:20,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:38:20" (1/1) ... [2023-02-15 21:38:20,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:38:20" (1/1) ... [2023-02-15 21:38:20,037 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2023-02-15 21:38:20,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 21:38:20,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 21:38:20,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 21:38:20,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 21:38:20,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:38:20" (1/1) ... [2023-02-15 21:38:20,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:38:20" (1/1) ... [2023-02-15 21:38:20,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:38:20" (1/1) ... [2023-02-15 21:38:20,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:38:20" (1/1) ... [2023-02-15 21:38:20,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:38:20" (1/1) ... [2023-02-15 21:38:20,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:38:20" (1/1) ... [2023-02-15 21:38:20,049 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:38:20" (1/1) ... [2023-02-15 21:38:20,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:38:20" (1/1) ... [2023-02-15 21:38:20,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 21:38:20,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 21:38:20,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 21:38:20,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 21:38:20,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:38:20" (1/1) ... [2023-02-15 21:38:20,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:38:20,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:38:20,091 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-15 21:38:20,093 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-15 21:38:20,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 21:38:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 21:38:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-02-15 21:38:20,125 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-02-15 21:38:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-02-15 21:38:20,125 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-02-15 21:38:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 21:38:20,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 21:38:20,166 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 21:38:20,168 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 21:38:20,251 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 21:38:20,255 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 21:38:20,255 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 21:38:20,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:38:20 BoogieIcfgContainer [2023-02-15 21:38:20,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 21:38:20,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 21:38:20,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 21:38:20,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 21:38:20,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:38:19" (1/3) ... [2023-02-15 21:38:20,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:38:20, skipping insertion in model container [2023-02-15 21:38:20,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:38:20" (2/3) ... [2023-02-15 21:38:20,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:38:20, skipping insertion in model container [2023-02-15 21:38:20,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:38:20" (3/3) ... [2023-02-15 21:38:20,264 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2023-02-15 21:38:20,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 21:38:20,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 21:38:20,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 21:38:20,326 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;@1e186725, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 21:38:20,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 21:38:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 21:38:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 21:38:20,335 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:20,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:20,336 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:20,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2023-02-15 21:38:20,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:20,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14789954] [2023-02-15 21:38:20,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:20,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:20,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:20,556 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-15 21:38:20,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:38:20,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14789954] [2023-02-15 21:38:20,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14789954] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:38:20,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:38:20,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 21:38:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102094694] [2023-02-15 21:38:20,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:38:20,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:38:20,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:38:20,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:38:20,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:38:20,602 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 21:38:20,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:38:20,674 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2023-02-15 21:38:20,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:38:20,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-02-15 21:38:20,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:38:20,685 INFO L225 Difference]: With dead ends: 43 [2023-02-15 21:38:20,685 INFO L226 Difference]: Without dead ends: 27 [2023-02-15 21:38:20,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:38:20,690 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:38:20,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:38:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-15 21:38:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-15 21:38:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-15 21:38:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-02-15 21:38:20,728 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2023-02-15 21:38:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:38:20,728 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-02-15 21:38:20,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 21:38:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-02-15 21:38:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 21:38:20,730 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:20,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:20,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 21:38:20,730 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:20,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:20,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2023-02-15 21:38:20,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:20,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68396872] [2023-02-15 21:38:20,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:20,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:20,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:20,804 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-15 21:38:20,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:38:20,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68396872] [2023-02-15 21:38:20,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68396872] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:38:20,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:38:20,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 21:38:20,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433708904] [2023-02-15 21:38:20,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:38:20,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:38:20,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:38:20,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:38:20,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:38:20,807 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 21:38:20,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:38:20,825 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-02-15 21:38:20,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:38:20,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-02-15 21:38:20,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:38:20,826 INFO L225 Difference]: With dead ends: 33 [2023-02-15 21:38:20,826 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 21:38:20,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:38:20,828 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:38:20,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:38:20,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 21:38:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-02-15 21:38:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-15 21:38:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-02-15 21:38:20,837 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2023-02-15 21:38:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:38:20,837 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-02-15 21:38:20,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 21:38:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-02-15 21:38:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 21:38:20,838 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:20,839 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:20,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 21:38:20,839 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:20,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:20,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2023-02-15 21:38:20,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:20,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408535282] [2023-02-15 21:38:20,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:20,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:20,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:20,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:20,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 21:38:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:38:20,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:38:20,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408535282] [2023-02-15 21:38:20,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408535282] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:38:20,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984018062] [2023-02-15 21:38:20,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:20,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:20,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:38:20,981 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-15 21:38:20,983 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-15 21:38:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:21,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 21:38:21,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:38:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:38:21,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:38:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:38:21,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984018062] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:38:21,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:38:21,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2023-02-15 21:38:21,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161548063] [2023-02-15 21:38:21,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:38:21,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 21:38:21,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:38:21,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 21:38:21,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-15 21:38:21,347 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 21:38:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:38:21,464 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2023-02-15 21:38:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 21:38:21,465 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2023-02-15 21:38:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:38:21,466 INFO L225 Difference]: With dead ends: 55 [2023-02-15 21:38:21,466 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 21:38:21,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-02-15 21:38:21,467 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:38:21,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 112 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:38:21,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 21:38:21,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-15 21:38:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 21:38:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-02-15 21:38:21,473 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2023-02-15 21:38:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:38:21,473 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-02-15 21:38:21,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 21:38:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-02-15 21:38:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 21:38:21,474 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:21,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:21,499 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-15 21:38:21,678 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-15 21:38:21,680 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:21,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2023-02-15 21:38:21,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:21,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954634500] [2023-02-15 21:38:21,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:21,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:21,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:21,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:38:21,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:38:21,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954634500] [2023-02-15 21:38:21,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954634500] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:38:21,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878484028] [2023-02-15 21:38:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:21,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:21,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:38:21,830 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-15 21:38:21,840 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-15 21:38:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:21,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 21:38:21,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:38:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:38:21,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:38:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:38:22,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878484028] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:38:22,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:38:22,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2023-02-15 21:38:22,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117367668] [2023-02-15 21:38:22,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:38:22,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 21:38:22,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:38:22,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 21:38:22,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-15 21:38:22,030 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:38:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:38:22,152 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2023-02-15 21:38:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:38:22,152 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2023-02-15 21:38:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:38:22,158 INFO L225 Difference]: With dead ends: 51 [2023-02-15 21:38:22,158 INFO L226 Difference]: Without dead ends: 47 [2023-02-15 21:38:22,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:38:22,161 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:38:22,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 92 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:38:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-15 21:38:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-02-15 21:38:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2023-02-15 21:38:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2023-02-15 21:38:22,171 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2023-02-15 21:38:22,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:38:22,172 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2023-02-15 21:38:22,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:38:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2023-02-15 21:38:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 21:38:22,173 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:22,173 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:22,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 21:38:22,377 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-15 21:38:22,378 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:22,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:22,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2023-02-15 21:38:22,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:22,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090227392] [2023-02-15 21:38:22,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:22,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:22,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:22,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:22,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:22,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 21:38:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:22,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 21:38:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 21:38:22,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:38:22,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090227392] [2023-02-15 21:38:22,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090227392] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:38:22,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136429414] [2023-02-15 21:38:22,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:22,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:22,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:38:22,493 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-15 21:38:22,495 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-15 21:38:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:22,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 21:38:22,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:38:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:38:22,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:38:22,814 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:38:22,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136429414] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:38:22,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:38:22,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2023-02-15 21:38:22,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5365070] [2023-02-15 21:38:22,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:38:22,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 21:38:22,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:38:22,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 21:38:22,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-02-15 21:38:22,820 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2023-02-15 21:38:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:38:22,988 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2023-02-15 21:38:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 21:38:22,988 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2023-02-15 21:38:22,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:38:22,992 INFO L225 Difference]: With dead ends: 105 [2023-02-15 21:38:22,992 INFO L226 Difference]: Without dead ends: 63 [2023-02-15 21:38:22,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-02-15 21:38:22,996 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 57 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:38:22,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 95 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:38:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-15 21:38:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-15 21:38:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2023-02-15 21:38:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2023-02-15 21:38:23,013 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2023-02-15 21:38:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:38:23,013 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2023-02-15 21:38:23,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2023-02-15 21:38:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2023-02-15 21:38:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 21:38:23,015 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:23,015 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:23,022 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-15 21:38:23,219 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-15 21:38:23,220 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:23,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2023-02-15 21:38:23,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:23,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949252341] [2023-02-15 21:38:23,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:23,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:23,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:23,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:23,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:23,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:23,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 21:38:23,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:38:23,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949252341] [2023-02-15 21:38:23,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949252341] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:38:23,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291495202] [2023-02-15 21:38:23,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:23,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:23,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:38:23,317 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-15 21:38:23,359 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-15 21:38:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:23,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 21:38:23,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:38:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 21:38:23,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:38:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:38:23,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291495202] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:38:23,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:38:23,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2023-02-15 21:38:23,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017514480] [2023-02-15 21:38:23,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:38:23,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 21:38:23,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:38:23,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 21:38:23,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-02-15 21:38:23,647 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2023-02-15 21:38:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:38:23,929 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2023-02-15 21:38:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 21:38:23,929 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2023-02-15 21:38:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:38:23,935 INFO L225 Difference]: With dead ends: 177 [2023-02-15 21:38:23,935 INFO L226 Difference]: Without dead ends: 117 [2023-02-15 21:38:23,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2023-02-15 21:38:23,937 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:38:23,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 222 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:38:23,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-15 21:38:23,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2023-02-15 21:38:23,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2023-02-15 21:38:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2023-02-15 21:38:23,974 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2023-02-15 21:38:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:38:23,975 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2023-02-15 21:38:23,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2023-02-15 21:38:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2023-02-15 21:38:23,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 21:38:23,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:23,982 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:23,986 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-15 21:38:24,186 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-15 21:38:24,186 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:24,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:24,187 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2023-02-15 21:38:24,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:24,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211688448] [2023-02-15 21:38:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:24,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:24,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:24,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:24,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:24,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 21:38:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 21:38:24,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:38:24,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211688448] [2023-02-15 21:38:24,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211688448] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:38:24,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730022567] [2023-02-15 21:38:24,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:24,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:24,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:38:24,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:38:24,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 21:38:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:24,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 21:38:24,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:38:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 21:38:24,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:38:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 21:38:24,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730022567] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:38:24,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:38:24,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2023-02-15 21:38:24,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850348341] [2023-02-15 21:38:24,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:38:24,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 21:38:24,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:38:24,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 21:38:24,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-02-15 21:38:24,792 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2023-02-15 21:38:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:38:25,116 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2023-02-15 21:38:25,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 21:38:25,116 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2023-02-15 21:38:25,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:38:25,118 INFO L225 Difference]: With dead ends: 255 [2023-02-15 21:38:25,118 INFO L226 Difference]: Without dead ends: 155 [2023-02-15 21:38:25,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2023-02-15 21:38:25,119 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:38:25,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 227 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:38:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-15 21:38:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2023-02-15 21:38:25,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2023-02-15 21:38:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2023-02-15 21:38:25,131 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2023-02-15 21:38:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:38:25,131 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2023-02-15 21:38:25,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2023-02-15 21:38:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2023-02-15 21:38:25,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-02-15 21:38:25,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:25,134 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:25,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 21:38:25,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:25,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:25,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:25,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1770426885, now seen corresponding path program 1 times [2023-02-15 21:38:25,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:25,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931176386] [2023-02-15 21:38:25,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:25,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-15 21:38:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 79 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-15 21:38:25,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:38:25,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931176386] [2023-02-15 21:38:25,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931176386] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:38:25,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305605336] [2023-02-15 21:38:25,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:25,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:25,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:38:25,660 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:38:25,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 21:38:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:25,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 21:38:25,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:38:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-02-15 21:38:25,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:38:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 129 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2023-02-15 21:38:26,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305605336] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:38:26,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:38:26,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2023-02-15 21:38:26,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751563911] [2023-02-15 21:38:26,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:38:26,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 21:38:26,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:38:26,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 21:38:26,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2023-02-15 21:38:26,315 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 24 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 24 states have internal predecessors, (76), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2023-02-15 21:38:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:38:26,596 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2023-02-15 21:38:26,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 21:38:26,596 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 24 states have internal predecessors, (76), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) Word has length 107 [2023-02-15 21:38:26,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:38:26,597 INFO L225 Difference]: With dead ends: 240 [2023-02-15 21:38:26,597 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 21:38:26,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 227 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 21:38:26,599 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 89 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:38:26,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 201 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:38:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 21:38:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2023-02-15 21:38:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2023-02-15 21:38:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2023-02-15 21:38:26,607 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 107 [2023-02-15 21:38:26,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:38:26,607 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2023-02-15 21:38:26,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 24 states have internal predecessors, (76), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2023-02-15 21:38:26,607 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2023-02-15 21:38:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-02-15 21:38:26,609 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:26,610 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:26,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 21:38:26,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:26,815 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:26,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:26,815 INFO L85 PathProgramCache]: Analyzing trace with hash -222615371, now seen corresponding path program 1 times [2023-02-15 21:38:26,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:26,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449909561] [2023-02-15 21:38:26,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:26,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-15 21:38:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-02-15 21:38:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 21:38:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 62 proven. 123 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2023-02-15 21:38:27,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:38:27,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449909561] [2023-02-15 21:38:27,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449909561] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:38:27,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947072718] [2023-02-15 21:38:27,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:27,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:27,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:38:27,180 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:38:27,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 21:38:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:27,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 21:38:27,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:38:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 25 proven. 190 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2023-02-15 21:38:27,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:38:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 25 proven. 206 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-02-15 21:38:28,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947072718] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:38:28,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:38:28,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 26 [2023-02-15 21:38:28,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034273739] [2023-02-15 21:38:28,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:38:28,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 21:38:28,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:38:28,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 21:38:28,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2023-02-15 21:38:28,297 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 26 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 26 states have internal predecessors, (83), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2023-02-15 21:38:28,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:38:28,698 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2023-02-15 21:38:28,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 21:38:28,699 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 26 states have internal predecessors, (83), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) Word has length 134 [2023-02-15 21:38:28,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:38:28,700 INFO L225 Difference]: With dead ends: 214 [2023-02-15 21:38:28,700 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 21:38:28,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 287 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 21:38:28,702 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 75 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:38:28,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 208 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:38:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 21:38:28,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2023-02-15 21:38:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 78 states have internal predecessors, (93), 20 states have call successors, (20), 11 states have call predecessors, (20), 16 states have return successors, (56), 24 states have call predecessors, (56), 20 states have call successors, (56) [2023-02-15 21:38:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2023-02-15 21:38:28,709 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 134 [2023-02-15 21:38:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:38:28,709 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2023-02-15 21:38:28,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 26 states have internal predecessors, (83), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2023-02-15 21:38:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2023-02-15 21:38:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2023-02-15 21:38:28,712 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:28,712 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 26, 26, 25, 22, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:28,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 21:38:28,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:28,917 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:28,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:28,918 INFO L85 PathProgramCache]: Analyzing trace with hash 12289001, now seen corresponding path program 1 times [2023-02-15 21:38:28,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:28,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78947690] [2023-02-15 21:38:28,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:28,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-15 21:38:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-02-15 21:38:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-15 21:38:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4131 backedges. 203 proven. 582 refuted. 0 times theorem prover too weak. 3346 trivial. 0 not checked. [2023-02-15 21:38:29,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:38:29,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78947690] [2023-02-15 21:38:29,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78947690] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:38:29,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297027995] [2023-02-15 21:38:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:29,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:29,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:38:29,849 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:38:29,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 21:38:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:30,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 21:38:30,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:38:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4131 backedges. 113 proven. 823 refuted. 0 times theorem prover too weak. 3195 trivial. 0 not checked. [2023-02-15 21:38:30,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:38:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4131 backedges. 113 proven. 847 refuted. 0 times theorem prover too weak. 3171 trivial. 0 not checked. [2023-02-15 21:38:31,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297027995] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:38:31,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:38:31,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 28 [2023-02-15 21:38:31,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463652694] [2023-02-15 21:38:31,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:38:31,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 21:38:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:38:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 21:38:31,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2023-02-15 21:38:31,810 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2023-02-15 21:38:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:38:32,345 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2023-02-15 21:38:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 21:38:32,346 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) Word has length 381 [2023-02-15 21:38:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:38:32,347 INFO L225 Difference]: With dead ends: 260 [2023-02-15 21:38:32,348 INFO L226 Difference]: Without dead ends: 155 [2023-02-15 21:38:32,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 851 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=342, Invalid=1638, Unknown=0, NotChecked=0, Total=1980 [2023-02-15 21:38:32,349 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 97 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:38:32,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 259 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:38:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-15 21:38:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2023-02-15 21:38:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 99 states have internal predecessors, (125), 26 states have call successors, (26), 18 states have call predecessors, (26), 17 states have return successors, (73), 27 states have call predecessors, (73), 26 states have call successors, (73) [2023-02-15 21:38:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2023-02-15 21:38:32,360 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 381 [2023-02-15 21:38:32,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:38:32,360 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2023-02-15 21:38:32,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2023-02-15 21:38:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2023-02-15 21:38:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2023-02-15 21:38:32,366 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:32,366 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 27, 27, 24, 23, 16, 16, 16, 16, 16, 16, 16, 13, 13, 13, 13, 13, 13, 13, 11, 8, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:32,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 21:38:32,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 21:38:32,572 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:32,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:32,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1938766977, now seen corresponding path program 2 times [2023-02-15 21:38:32,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:32,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113614467] [2023-02-15 21:38:32,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:32,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:32,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-02-15 21:38:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-02-15 21:38:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2023-02-15 21:38:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 264 proven. 658 refuted. 0 times theorem prover too weak. 3787 trivial. 0 not checked. [2023-02-15 21:38:33,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:38:33,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113614467] [2023-02-15 21:38:33,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113614467] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:38:33,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219042446] [2023-02-15 21:38:33,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:38:33,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:33,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:38:33,511 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:38:33,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 21:38:33,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 21:38:33,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:38:33,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 21:38:33,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:38:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 158 proven. 973 refuted. 0 times theorem prover too weak. 3578 trivial. 0 not checked. [2023-02-15 21:38:33,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:38:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 158 proven. 1006 refuted. 0 times theorem prover too weak. 3545 trivial. 0 not checked. [2023-02-15 21:38:35,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219042446] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:38:35,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:38:35,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 30 [2023-02-15 21:38:35,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377200085] [2023-02-15 21:38:35,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:38:35,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 21:38:35,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:38:35,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 21:38:35,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2023-02-15 21:38:35,877 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 30 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 30 states have internal predecessors, (97), 24 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 15 states have call predecessors, (40), 24 states have call successors, (40) [2023-02-15 21:38:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:38:36,438 INFO L93 Difference]: Finished difference Result 334 states and 594 transitions. [2023-02-15 21:38:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 21:38:36,439 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 30 states have internal predecessors, (97), 24 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 15 states have call predecessors, (40), 24 states have call successors, (40) Word has length 405 [2023-02-15 21:38:36,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:38:36,444 INFO L225 Difference]: With dead ends: 334 [2023-02-15 21:38:36,444 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 21:38:36,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 961 GetRequests, 905 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=2044, Unknown=0, NotChecked=0, Total=2450 [2023-02-15 21:38:36,446 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 114 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:38:36,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 246 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:38:36,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 21:38:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 173. [2023-02-15 21:38:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 118 states have internal predecessors, (148), 32 states have call successors, (32), 24 states have call predecessors, (32), 18 states have return successors, (92), 30 states have call predecessors, (92), 32 states have call successors, (92) [2023-02-15 21:38:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 272 transitions. [2023-02-15 21:38:36,471 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 272 transitions. Word has length 405 [2023-02-15 21:38:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:38:36,472 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 272 transitions. [2023-02-15 21:38:36,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 30 states have internal predecessors, (97), 24 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 15 states have call predecessors, (40), 24 states have call successors, (40) [2023-02-15 21:38:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 272 transitions. [2023-02-15 21:38:36,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2023-02-15 21:38:36,492 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:36,493 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 42, 42, 35, 34, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 14, 13, 9, 7, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:36,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 21:38:36,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:36,698 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:36,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:36,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1326045706, now seen corresponding path program 3 times [2023-02-15 21:38:36,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:36,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212337876] [2023-02-15 21:38:36,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:36,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-02-15 21:38:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:37,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-02-15 21:38:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2023-02-15 21:38:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9892 backedges. 1598 proven. 1117 refuted. 0 times theorem prover too weak. 7177 trivial. 0 not checked. [2023-02-15 21:38:38,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:38:38,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212337876] [2023-02-15 21:38:38,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212337876] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:38:38,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738009824] [2023-02-15 21:38:38,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 21:38:38,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:38,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:38:38,374 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:38:38,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 21:38:38,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-15 21:38:38,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:38:38,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 21:38:38,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:38:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9892 backedges. 1559 proven. 84 refuted. 0 times theorem prover too weak. 8249 trivial. 0 not checked. [2023-02-15 21:38:38,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:38:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9892 backedges. 1559 proven. 89 refuted. 0 times theorem prover too weak. 8244 trivial. 0 not checked. [2023-02-15 21:38:40,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738009824] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:38:40,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:38:40,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 14, 17] total 41 [2023-02-15 21:38:40,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268949870] [2023-02-15 21:38:40,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:38:40,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 21:38:40,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:38:40,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 21:38:40,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1395, Unknown=0, NotChecked=0, Total=1640 [2023-02-15 21:38:40,159 INFO L87 Difference]: Start difference. First operand 173 states and 272 transitions. Second operand has 41 states, 41 states have (on average 2.8292682926829267) internal successors, (116), 41 states have internal predecessors, (116), 26 states have call successors, (38), 1 states have call predecessors, (38), 17 states have return successors, (49), 31 states have call predecessors, (49), 26 states have call successors, (49) [2023-02-15 21:38:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:38:40,656 INFO L93 Difference]: Finished difference Result 391 states and 703 transitions. [2023-02-15 21:38:40,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 21:38:40,657 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.8292682926829267) internal successors, (116), 41 states have internal predecessors, (116), 26 states have call successors, (38), 1 states have call predecessors, (38), 17 states have return successors, (49), 31 states have call predecessors, (49), 26 states have call successors, (49) Word has length 583 [2023-02-15 21:38:40,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:38:40,659 INFO L225 Difference]: With dead ends: 391 [2023-02-15 21:38:40,659 INFO L226 Difference]: Without dead ends: 220 [2023-02-15 21:38:40,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1373 GetRequests, 1314 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=414, Invalid=2238, Unknown=0, NotChecked=0, Total=2652 [2023-02-15 21:38:40,661 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 76 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:38:40,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 465 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:38:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-15 21:38:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2023-02-15 21:38:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 155 states have (on average 1.0516129032258064) internal successors, (163), 149 states have internal predecessors, (163), 42 states have call successors, (42), 35 states have call predecessors, (42), 18 states have return successors, (109), 31 states have call predecessors, (109), 42 states have call successors, (109) [2023-02-15 21:38:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 314 transitions. [2023-02-15 21:38:40,684 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 314 transitions. Word has length 583 [2023-02-15 21:38:40,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:38:40,684 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 314 transitions. [2023-02-15 21:38:40,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.8292682926829267) internal successors, (116), 41 states have internal predecessors, (116), 26 states have call successors, (38), 1 states have call predecessors, (38), 17 states have return successors, (49), 31 states have call predecessors, (49), 26 states have call successors, (49) [2023-02-15 21:38:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 314 transitions. [2023-02-15 21:38:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 978 [2023-02-15 21:38:40,717 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:40,718 INFO L195 NwaCegarLoop]: trace histogram [74, 74, 69, 69, 58, 57, 37, 37, 37, 37, 37, 37, 37, 34, 34, 34, 34, 34, 34, 34, 24, 20, 16, 12, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:40,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 21:38:40,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 21:38:40,923 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:40,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:40,923 INFO L85 PathProgramCache]: Analyzing trace with hash -985382679, now seen corresponding path program 4 times [2023-02-15 21:38:40,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:40,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578837984] [2023-02-15 21:38:40,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:40,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:41,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 21:38:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-02-15 21:38:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 21:38:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2023-02-15 21:38:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:42,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 21:38:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-02-15 21:38:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 21:38:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 28345 backedges. 691 proven. 2972 refuted. 0 times theorem prover too weak. 24682 trivial. 0 not checked. [2023-02-15 21:38:43,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:38:43,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578837984] [2023-02-15 21:38:43,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578837984] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:38:43,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368571342] [2023-02-15 21:38:43,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 21:38:43,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:43,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:38:43,111 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:38:43,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 21:38:43,389 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 21:38:43,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:38:43,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 1738 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 21:38:43,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:38:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 28345 backedges. 365 proven. 2987 refuted. 0 times theorem prover too weak. 24993 trivial. 0 not checked. [2023-02-15 21:38:43,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:38:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 28345 backedges. 365 proven. 3031 refuted. 0 times theorem prover too weak. 24949 trivial. 0 not checked. [2023-02-15 21:38:47,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368571342] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:38:47,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:38:47,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 21] total 37 [2023-02-15 21:38:47,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844936533] [2023-02-15 21:38:47,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:38:47,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-15 21:38:47,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:38:47,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-15 21:38:47,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 21:38:47,298 INFO L87 Difference]: Start difference. First operand 216 states and 314 transitions. Second operand has 37 states, 36 states have (on average 3.111111111111111) internal successors, (112), 37 states have internal predecessors, (112), 30 states have call successors, (37), 1 states have call predecessors, (37), 15 states have return successors, (50), 22 states have call predecessors, (50), 30 states have call successors, (50) [2023-02-15 21:38:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:38:48,078 INFO L93 Difference]: Finished difference Result 509 states and 830 transitions. [2023-02-15 21:38:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-15 21:38:48,079 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.111111111111111) internal successors, (112), 37 states have internal predecessors, (112), 30 states have call successors, (37), 1 states have call predecessors, (37), 15 states have return successors, (50), 22 states have call predecessors, (50), 30 states have call successors, (50) Word has length 977 [2023-02-15 21:38:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:38:48,084 INFO L225 Difference]: With dead ends: 509 [2023-02-15 21:38:48,085 INFO L226 Difference]: Without dead ends: 284 [2023-02-15 21:38:48,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2284 GetRequests, 2214 SyntacticMatches, 10 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=586, Invalid=3196, Unknown=0, NotChecked=0, Total=3782 [2023-02-15 21:38:48,088 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 132 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 21:38:48,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 333 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 21:38:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-02-15 21:38:48,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 252. [2023-02-15 21:38:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 179 states have (on average 1.0502793296089385) internal successors, (188), 175 states have internal predecessors, (188), 52 states have call successors, (52), 41 states have call predecessors, (52), 20 states have return successors, (141), 35 states have call predecessors, (141), 52 states have call successors, (141) [2023-02-15 21:38:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 381 transitions. [2023-02-15 21:38:48,105 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 381 transitions. Word has length 977 [2023-02-15 21:38:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:38:48,106 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 381 transitions. [2023-02-15 21:38:48,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.111111111111111) internal successors, (112), 37 states have internal predecessors, (112), 30 states have call successors, (37), 1 states have call predecessors, (37), 15 states have return successors, (50), 22 states have call predecessors, (50), 30 states have call successors, (50) [2023-02-15 21:38:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 381 transitions. [2023-02-15 21:38:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1142 [2023-02-15 21:38:48,113 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:48,113 INFO L195 NwaCegarLoop]: trace histogram [84, 84, 83, 83, 68, 67, 42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 26, 26, 17, 15, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:48,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 21:38:48,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-15 21:38:48,320 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:48,322 INFO L85 PathProgramCache]: Analyzing trace with hash 604830089, now seen corresponding path program 5 times [2023-02-15 21:38:48,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:48,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901517744] [2023-02-15 21:38:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:48,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:49,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:49,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 21:38:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-15 21:38:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-15 21:38:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 21:38:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:50,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2023-02-15 21:38:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 21:38:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-15 21:38:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 4425 proven. 3360 refuted. 0 times theorem prover too weak. 30984 trivial. 0 not checked. [2023-02-15 21:38:51,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:38:51,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901517744] [2023-02-15 21:38:51,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901517744] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:38:51,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531508529] [2023-02-15 21:38:51,651 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 21:38:51,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:38:51,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:38:51,653 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:38:51,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 21:38:52,121 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) [2023-02-15 21:38:52,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:38:52,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 2422 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 21:38:52,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:38:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 4274 proven. 901 refuted. 0 times theorem prover too weak. 33594 trivial. 0 not checked. [2023-02-15 21:38:52,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:38:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 4274 proven. 927 refuted. 0 times theorem prover too weak. 33568 trivial. 0 not checked. [2023-02-15 21:38:55,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531508529] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:38:55,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:38:55,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 18, 25] total 58 [2023-02-15 21:38:55,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614954836] [2023-02-15 21:38:55,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:38:55,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-02-15 21:38:55,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:38:55,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-02-15 21:38:55,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=2848, Unknown=0, NotChecked=0, Total=3306 [2023-02-15 21:38:55,795 INFO L87 Difference]: Start difference. First operand 252 states and 381 transitions. Second operand has 58 states, 57 states have (on average 2.6140350877192984) internal successors, (149), 58 states have internal predecessors, (149), 41 states have call successors, (51), 1 states have call predecessors, (51), 22 states have return successors, (71), 39 states have call predecessors, (71), 41 states have call successors, (71) [2023-02-15 21:38:56,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:38:56,903 INFO L93 Difference]: Finished difference Result 562 states and 936 transitions. [2023-02-15 21:38:56,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-02-15 21:38:56,904 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.6140350877192984) internal successors, (149), 58 states have internal predecessors, (149), 41 states have call successors, (51), 1 states have call predecessors, (51), 22 states have return successors, (71), 39 states have call predecessors, (71), 41 states have call successors, (71) Word has length 1141 [2023-02-15 21:38:56,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:38:56,907 INFO L225 Difference]: With dead ends: 562 [2023-02-15 21:38:56,907 INFO L226 Difference]: Without dead ends: 321 [2023-02-15 21:38:56,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2677 GetRequests, 2586 SyntacticMatches, 12 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2986 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=883, Invalid=5597, Unknown=0, NotChecked=0, Total=6480 [2023-02-15 21:38:56,911 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 177 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 2330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 21:38:56,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 817 Invalid, 2330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 21:38:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-02-15 21:38:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 270. [2023-02-15 21:38:56,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 193 states have (on average 1.0310880829015545) internal successors, (199), 189 states have internal predecessors, (199), 56 states have call successors, (56), 46 states have call predecessors, (56), 20 states have return successors, (145), 34 states have call predecessors, (145), 56 states have call successors, (145) [2023-02-15 21:38:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 400 transitions. [2023-02-15 21:38:56,923 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 400 transitions. Word has length 1141 [2023-02-15 21:38:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:38:56,924 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 400 transitions. [2023-02-15 21:38:56,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.6140350877192984) internal successors, (149), 58 states have internal predecessors, (149), 41 states have call successors, (51), 1 states have call predecessors, (51), 22 states have return successors, (71), 39 states have call predecessors, (71), 41 states have call successors, (71) [2023-02-15 21:38:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 400 transitions. [2023-02-15 21:38:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1142 [2023-02-15 21:38:56,931 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:38:56,932 INFO L195 NwaCegarLoop]: trace histogram [84, 84, 83, 83, 68, 67, 42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 27, 25, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:38:56,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-02-15 21:38:57,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-15 21:38:57,147 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:38:57,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:38:57,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1234092307, now seen corresponding path program 6 times [2023-02-15 21:38:57,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:38:57,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233748425] [2023-02-15 21:38:57,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:38:57,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:38:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:58,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:38:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:58,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 21:38:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-15 21:38:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 21:38:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 568 [2023-02-15 21:38:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:38:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 21:38:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:38:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:38:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:38:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:38:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:38:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:38:59,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 854 [2023-02-15 21:38:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:39:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:39:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:39:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:39:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:39:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:39:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:39:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 21:39:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:39:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:39:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:39:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:39:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 21:39:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:39:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:39:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:39:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:39:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 21:39:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 21:39:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 21:39:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:39:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:39:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 3068 proven. 3268 refuted. 0 times theorem prover too weak. 32433 trivial. 0 not checked. [2023-02-15 21:39:00,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:39:00,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233748425] [2023-02-15 21:39:00,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233748425] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:39:00,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609329183] [2023-02-15 21:39:00,348 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 21:39:00,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:39:00,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:39:00,349 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:39:00,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 21:39:00,697 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2023-02-15 21:39:00,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:39:00,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 21:39:00,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:39:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 1497 proven. 2903 refuted. 0 times theorem prover too weak. 34369 trivial. 0 not checked. [2023-02-15 21:39:00,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:39:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 1499 proven. 2957 refuted. 0 times theorem prover too weak. 34313 trivial. 0 not checked. [2023-02-15 21:39:05,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609329183] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:39:05,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:39:05,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 15, 23] total 51 [2023-02-15 21:39:05,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225562034] [2023-02-15 21:39:05,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:39:05,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 21:39:05,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:39:05,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 21:39:05,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=2201, Unknown=0, NotChecked=0, Total=2550 [2023-02-15 21:39:05,464 INFO L87 Difference]: Start difference. First operand 270 states and 400 transitions. Second operand has 51 states, 50 states have (on average 2.62) internal successors, (131), 51 states have internal predecessors, (131), 36 states have call successors, (43), 1 states have call predecessors, (43), 22 states have return successors, (62), 36 states have call predecessors, (62), 36 states have call successors, (62) [2023-02-15 21:39:06,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:39:06,902 INFO L93 Difference]: Finished difference Result 634 states and 1112 transitions. [2023-02-15 21:39:06,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-02-15 21:39:06,903 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.62) internal successors, (131), 51 states have internal predecessors, (131), 36 states have call successors, (43), 1 states have call predecessors, (43), 22 states have return successors, (62), 36 states have call predecessors, (62), 36 states have call successors, (62) Word has length 1141 [2023-02-15 21:39:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:39:06,906 INFO L225 Difference]: With dead ends: 634 [2023-02-15 21:39:06,906 INFO L226 Difference]: Without dead ends: 315 [2023-02-15 21:39:06,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2678 GetRequests, 2586 SyntacticMatches, 11 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2576 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=898, Invalid=5908, Unknown=0, NotChecked=0, Total=6806 [2023-02-15 21:39:06,909 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 191 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 2732 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 2732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:39:06,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 783 Invalid, 3111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 2732 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 21:39:06,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-02-15 21:39:06,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 279. [2023-02-15 21:39:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 199 states have (on average 1.020100502512563) internal successors, (203), 196 states have internal predecessors, (203), 59 states have call successors, (59), 48 states have call predecessors, (59), 20 states have return successors, (70), 34 states have call predecessors, (70), 59 states have call successors, (70) [2023-02-15 21:39:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 332 transitions. [2023-02-15 21:39:06,934 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 332 transitions. Word has length 1141 [2023-02-15 21:39:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:39:06,935 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 332 transitions. [2023-02-15 21:39:06,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.62) internal successors, (131), 51 states have internal predecessors, (131), 36 states have call successors, (43), 1 states have call predecessors, (43), 22 states have return successors, (62), 36 states have call predecessors, (62), 36 states have call successors, (62) [2023-02-15 21:39:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 332 transitions. [2023-02-15 21:39:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2023-02-15 21:39:06,943 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:39:06,943 INFO L195 NwaCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:39:06,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 21:39:07,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 21:39:07,149 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:39:07,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:39:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash -553145382, now seen corresponding path program 7 times [2023-02-15 21:39:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:39:07,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401786949] [2023-02-15 21:39:07,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:39:07,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:39:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 21:39:07,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 21:39:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 21:39:07,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 21:39:07,605 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 21:39:07,606 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 21:39:07,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 21:39:07,610 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:39:07,615 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 21:39:07,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 09:39:07 BoogieIcfgContainer [2023-02-15 21:39:07,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 21:39:07,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 21:39:07,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 21:39:07,768 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 21:39:07,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:38:20" (3/4) ... [2023-02-15 21:39:07,769 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 21:39:07,862 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 21:39:07,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 21:39:07,862 INFO L158 Benchmark]: Toolchain (without parser) took 48015.34ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 112.1MB in the beginning and 812.4MB in the end (delta: -700.3MB). Peak memory consumption was 389.3MB. Max. memory is 16.1GB. [2023-02-15 21:39:07,863 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 71.4MB in the end (delta: 181.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:39:07,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.40ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 102.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 21:39:07,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.18ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 100.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:39:07,864 INFO L158 Benchmark]: Boogie Preprocessor took 12.89ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 21:39:07,865 INFO L158 Benchmark]: RCFGBuilder took 205.38ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 89.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 21:39:07,865 INFO L158 Benchmark]: TraceAbstraction took 47508.83ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 88.8MB in the beginning and 836.5MB in the end (delta: -747.7MB). Peak memory consumption was 343.2MB. Max. memory is 16.1GB. [2023-02-15 21:39:07,865 INFO L158 Benchmark]: Witness Printer took 94.60ms. Allocated memory is still 1.2GB. Free memory was 836.5MB in the beginning and 812.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-02-15 21:39:07,868 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.13ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 71.4MB in the end (delta: 181.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.40ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 102.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.18ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 100.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.89ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 205.38ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 89.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 47508.83ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 88.8MB in the beginning and 836.5MB in the end (delta: -747.7MB). Peak memory consumption was 343.2MB. Max. memory is 16.1GB. * Witness Printer took 94.60ms. Allocated memory is still 1.2GB. Free memory was 836.5MB in the beginning and 812.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 10; VAL [x=10] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L10] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L12] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L20] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L22] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L20] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L22] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L39] int result = fibo1(x); [L40] COND TRUE result == 55 VAL [result=55, x=10] [L41] reach_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.3s, OverallIterations: 16, TraceHistogramMax: 89, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1251 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1172 mSDsluCounter, 4305 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3761 mSDsCounter, 1979 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11204 IncrementalHoareTripleChecker+Invalid, 13183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1979 mSolverCounterUnsat, 544 mSDtfsCounter, 11204 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11952 GetRequests, 11332 SyntacticMatches, 82 SemanticMatches, 538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10016 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=15, InterpolantAutomatonStates: 397, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 266 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 11310 NumberOfCodeBlocks, 10096 NumberOfCodeBlocksAsserted, 134 NumberOfCheckSat, 15100 ConstructedInterpolants, 0 QuantifiedInterpolants, 19974 SizeOfPredicates, 77 NumberOfNonLiveVariables, 8643 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 345909/376359 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-15 21:39:07,903 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