./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 b5317dae 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-?-b5317da-m [2023-02-16 02:57:37,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 02:57:37,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 02:57:37,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 02:57:37,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 02:57:37,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 02:57:37,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 02:57:37,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 02:57:37,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 02:57:37,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 02:57:37,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 02:57:37,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 02:57:37,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 02:57:37,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 02:57:37,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 02:57:37,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 02:57:37,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 02:57:37,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 02:57:37,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 02:57:37,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 02:57:37,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 02:57:37,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 02:57:37,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 02:57:37,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 02:57:37,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 02:57:37,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 02:57:37,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 02:57:37,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 02:57:37,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 02:57:37,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 02:57:37,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 02:57:37,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 02:57:37,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 02:57:37,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 02:57:37,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 02:57:37,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 02:57:37,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 02:57:37,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 02:57:37,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 02:57:37,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 02:57:37,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 02:57:37,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 02:57:37,937 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 02:57:37,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 02:57:37,938 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 02:57:37,945 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 02:57:37,946 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 02:57:37,946 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 02:57:37,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 02:57:37,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 02:57:37,947 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 02:57:37,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 02:57:37,947 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 02:57:37,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 02:57:37,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 02:57:37,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 02:57:37,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 02:57:37,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 02:57:37,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 02:57:37,949 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 02:57:37,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 02:57:37,949 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 02:57:37,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 02:57:37,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 02:57:37,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 02:57:37,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 02:57:37,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 02:57:37,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 02:57:37,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 02:57:37,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 02:57:37,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 02:57:37,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 02:57:37,951 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 02:57:37,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 02:57:37,951 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 02:57:37,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 02:57:37,952 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 02:57:37,952 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-16 02:57:38,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 02:57:38,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 02:57:38,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 02:57:38,140 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 02:57:38,140 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 02:57:38,141 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-16 02:57:39,094 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 02:57:39,222 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 02:57:39,225 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2023-02-16 02:57:39,229 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc39639a5/40f608f4616547e7b8f9ea6e9c83ae38/FLAG0598cf7c8 [2023-02-16 02:57:39,240 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc39639a5/40f608f4616547e7b8f9ea6e9c83ae38 [2023-02-16 02:57:39,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 02:57:39,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 02:57:39,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 02:57:39,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 02:57:39,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 02:57:39,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 02:57:39" (1/1) ... [2023-02-16 02:57:39,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7304c43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:57:39, skipping insertion in model container [2023-02-16 02:57:39,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 02:57:39" (1/1) ... [2023-02-16 02:57:39,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 02:57:39,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 02:57:39,389 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-16 02:57:39,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 02:57:39,400 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 02:57:39,413 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-16 02:57:39,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 02:57:39,423 INFO L208 MainTranslator]: Completed translation [2023-02-16 02:57:39,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:57:39 WrapperNode [2023-02-16 02:57:39,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 02:57:39,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 02:57:39,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 02:57:39,425 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 02:57:39,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:57:39" (1/1) ... [2023-02-16 02:57:39,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:57:39" (1/1) ... [2023-02-16 02:57:39,444 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2023-02-16 02:57:39,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 02:57:39,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 02:57:39,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 02:57:39,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 02:57:39,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:57:39" (1/1) ... [2023-02-16 02:57:39,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:57:39" (1/1) ... [2023-02-16 02:57:39,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:57:39" (1/1) ... [2023-02-16 02:57:39,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:57:39" (1/1) ... [2023-02-16 02:57:39,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:57:39" (1/1) ... [2023-02-16 02:57:39,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:57:39" (1/1) ... [2023-02-16 02:57:39,462 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:57:39" (1/1) ... [2023-02-16 02:57:39,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:57:39" (1/1) ... [2023-02-16 02:57:39,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 02:57:39,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 02:57:39,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 02:57:39,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 02:57:39,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:57:39" (1/1) ... [2023-02-16 02:57:39,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 02:57:39,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:57:39,490 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-16 02:57:39,512 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-16 02:57:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 02:57:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 02:57:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-02-16 02:57:39,525 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-02-16 02:57:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-02-16 02:57:39,525 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-02-16 02:57:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 02:57:39,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 02:57:39,573 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 02:57:39,574 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 02:57:39,647 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 02:57:39,651 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 02:57:39,656 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-16 02:57:39,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:57:39 BoogieIcfgContainer [2023-02-16 02:57:39,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 02:57:39,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 02:57:39,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 02:57:39,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 02:57:39,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 02:57:39" (1/3) ... [2023-02-16 02:57:39,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8fd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 02:57:39, skipping insertion in model container [2023-02-16 02:57:39,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:57:39" (2/3) ... [2023-02-16 02:57:39,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8fd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 02:57:39, skipping insertion in model container [2023-02-16 02:57:39,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:57:39" (3/3) ... [2023-02-16 02:57:39,662 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2023-02-16 02:57:39,673 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 02:57:39,673 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 02:57:39,708 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 02:57:39,713 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;@462e05e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 02:57:39,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 02:57:39,716 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-16 02:57:39,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-16 02:57:39,721 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:57:39,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:57:39,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:57:39,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:57:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2023-02-16 02:57:39,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:57:39,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410061080] [2023-02-16 02:57:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:57:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:39,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:57:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:39,938 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-16 02:57:39,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:57:39,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410061080] [2023-02-16 02:57:39,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410061080] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:57:39,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:57:39,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 02:57:39,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940662780] [2023-02-16 02:57:39,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:57:39,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 02:57:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:57:39,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 02:57:39,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 02:57:39,963 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-16 02:57:39,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:57:39,998 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2023-02-16 02:57:39,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 02:57:40,000 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-16 02:57:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:57:40,006 INFO L225 Difference]: With dead ends: 43 [2023-02-16 02:57:40,006 INFO L226 Difference]: Without dead ends: 27 [2023-02-16 02:57:40,008 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-16 02:57:40,010 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-16 02:57:40,011 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-16 02:57:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-16 02:57:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-16 02:57:40,034 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-16 02:57:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-02-16 02:57:40,036 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2023-02-16 02:57:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:57:40,037 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-02-16 02:57:40,037 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-16 02:57:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-02-16 02:57:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 02:57:40,038 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:57:40,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:57:40,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 02:57:40,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:57:40,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:57:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2023-02-16 02:57:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:57:40,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958088153] [2023-02-16 02:57:40,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:40,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:57:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:40,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:57:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:40,131 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-16 02:57:40,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:57:40,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958088153] [2023-02-16 02:57:40,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958088153] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:57:40,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:57:40,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 02:57:40,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46152642] [2023-02-16 02:57:40,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:57:40,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 02:57:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:57:40,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 02:57:40,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 02:57:40,142 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-16 02:57:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:57:40,164 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-02-16 02:57:40,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 02:57:40,167 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-16 02:57:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:57:40,168 INFO L225 Difference]: With dead ends: 33 [2023-02-16 02:57:40,168 INFO L226 Difference]: Without dead ends: 29 [2023-02-16 02:57:40,168 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-16 02:57:40,169 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-16 02:57:40,170 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-16 02:57:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-16 02:57:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-02-16 02:57:40,174 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-16 02:57:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-02-16 02:57:40,175 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2023-02-16 02:57:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:57:40,175 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-02-16 02:57:40,176 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-16 02:57:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-02-16 02:57:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 02:57:40,177 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:57:40,177 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-16 02:57:40,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 02:57:40,177 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:57:40,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:57:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2023-02-16 02:57:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:57:40,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383193608] [2023-02-16 02:57:40,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:40,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:57:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:40,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:57:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:40,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:40,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 02:57:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:40,315 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-16 02:57:40,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:57:40,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383193608] [2023-02-16 02:57:40,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383193608] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:57:40,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917702896] [2023-02-16 02:57:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:40,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:57:40,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:57:40,319 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-16 02:57:40,320 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-16 02:57:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:40,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 02:57:40,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:57:40,471 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-16 02:57:40,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:57:40,704 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-16 02:57:40,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917702896] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:57:40,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:57:40,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2023-02-16 02:57:40,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730646567] [2023-02-16 02:57:40,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:57:40,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 02:57:40,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:57:40,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 02:57:40,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-16 02:57:40,713 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-16 02:57:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:57:40,879 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2023-02-16 02:57:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 02:57:40,879 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-16 02:57:40,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:57:40,880 INFO L225 Difference]: With dead ends: 55 [2023-02-16 02:57:40,880 INFO L226 Difference]: Without dead ends: 31 [2023-02-16 02:57:40,881 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-16 02:57:40,881 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-16 02:57:40,882 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-16 02:57:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-16 02:57:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-16 02:57:40,885 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-16 02:57:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-02-16 02:57:40,886 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2023-02-16 02:57:40,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:57:40,887 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-02-16 02:57:40,900 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-16 02:57:40,901 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-02-16 02:57:40,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 02:57:40,901 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:57:40,902 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-16 02:57:40,910 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-16 02:57:41,102 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-16 02:57:41,102 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:57:41,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:57:41,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2023-02-16 02:57:41,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:57:41,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978167500] [2023-02-16 02:57:41,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:41,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:57:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:41,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:57:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:41,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:41,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:41,291 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-16 02:57:41,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:57:41,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978167500] [2023-02-16 02:57:41,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978167500] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:57:41,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154393674] [2023-02-16 02:57:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:41,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:57:41,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:57:41,295 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-16 02:57:41,298 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-16 02:57:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:41,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 02:57:41,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:57:41,362 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-16 02:57:41,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:57:41,509 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-16 02:57:41,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154393674] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:57:41,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:57:41,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2023-02-16 02:57:41,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526655482] [2023-02-16 02:57:41,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:57:41,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 02:57:41,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:57:41,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 02:57:41,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-16 02:57:41,511 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-16 02:57:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:57:41,633 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2023-02-16 02:57:41,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 02:57:41,634 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-16 02:57:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:57:41,640 INFO L225 Difference]: With dead ends: 51 [2023-02-16 02:57:41,640 INFO L226 Difference]: Without dead ends: 47 [2023-02-16 02:57:41,640 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-16 02:57:41,642 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-16 02:57:41,644 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-16 02:57:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-16 02:57:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-02-16 02:57:41,657 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-16 02:57:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2023-02-16 02:57:41,658 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2023-02-16 02:57:41,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:57:41,658 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2023-02-16 02:57:41,658 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-16 02:57:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2023-02-16 02:57:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 02:57:41,659 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:57:41,660 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-16 02:57:41,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 02:57:41,863 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-16 02:57:41,863 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:57:41,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:57:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2023-02-16 02:57:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:57:41,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447519571] [2023-02-16 02:57:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:41,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:57:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:41,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:57:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:41,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:41,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:41,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 02:57:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:41,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-16 02:57:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:41,964 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-16 02:57:41,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:57:41,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447519571] [2023-02-16 02:57:41,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447519571] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:57:41,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638254350] [2023-02-16 02:57:41,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:41,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:57:41,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:57:41,969 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-16 02:57:41,970 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-16 02:57:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:42,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 02:57:42,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:57:42,060 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-16 02:57:42,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:57:42,298 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-16 02:57:42,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638254350] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:57:42,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:57:42,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2023-02-16 02:57:42,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135298359] [2023-02-16 02:57:42,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:57:42,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 02:57:42,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:57:42,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 02:57:42,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-02-16 02:57:42,302 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-16 02:57:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:57:42,459 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2023-02-16 02:57:42,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 02:57:42,459 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-16 02:57:42,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:57:42,460 INFO L225 Difference]: With dead ends: 105 [2023-02-16 02:57:42,460 INFO L226 Difference]: Without dead ends: 63 [2023-02-16 02:57:42,461 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-16 02:57:42,462 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-16 02:57:42,462 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-16 02:57:42,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-16 02:57:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-16 02:57:42,468 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-16 02:57:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2023-02-16 02:57:42,469 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2023-02-16 02:57:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:57:42,469 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2023-02-16 02:57:42,469 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-16 02:57:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2023-02-16 02:57:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 02:57:42,470 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:57:42,471 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-16 02:57:42,480 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-16 02:57:42,681 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-16 02:57:42,681 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:57:42,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:57:42,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2023-02-16 02:57:42,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:57:42,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141715397] [2023-02-16 02:57:42,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:42,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:57:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:42,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:57:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:42,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:42,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:42,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:42,769 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-16 02:57:42,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:57:42,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141715397] [2023-02-16 02:57:42,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141715397] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:57:42,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677058015] [2023-02-16 02:57:42,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:42,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:57:42,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:57:42,772 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-16 02:57:42,775 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-16 02:57:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:42,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 02:57:42,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:57:42,868 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-16 02:57:42,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:57:43,092 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-16 02:57:43,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677058015] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:57:43,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:57:43,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2023-02-16 02:57:43,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755905853] [2023-02-16 02:57:43,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:57:43,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 02:57:43,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:57:43,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 02:57:43,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-02-16 02:57:43,094 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-16 02:57:43,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:57:43,354 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2023-02-16 02:57:43,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 02:57:43,355 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-16 02:57:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:57:43,356 INFO L225 Difference]: With dead ends: 177 [2023-02-16 02:57:43,356 INFO L226 Difference]: Without dead ends: 117 [2023-02-16 02:57:43,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2023-02-16 02:57:43,358 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 02:57:43,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 222 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 02:57:43,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-16 02:57:43,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2023-02-16 02:57:43,375 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-16 02:57:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2023-02-16 02:57:43,380 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2023-02-16 02:57:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:57:43,380 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2023-02-16 02:57:43,380 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-16 02:57:43,380 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2023-02-16 02:57:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 02:57:43,382 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:57:43,382 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-16 02:57:43,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-16 02:57:43,583 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-16 02:57:43,583 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:57:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:57:43,584 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2023-02-16 02:57:43,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:57:43,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941751149] [2023-02-16 02:57:43,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:43,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:57:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:43,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:57:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:43,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:43,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:43,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:43,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:43,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:43,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-16 02:57:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:43,702 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-16 02:57:43,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:57:43,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941751149] [2023-02-16 02:57:43,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941751149] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:57:43,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935200675] [2023-02-16 02:57:43,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:43,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:57:43,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:57:43,704 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-16 02:57:43,706 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-16 02:57:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:43,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 02:57:43,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:57:43,800 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-16 02:57:43,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:57:44,157 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-16 02:57:44,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935200675] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:57:44,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:57:44,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2023-02-16 02:57:44,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658896789] [2023-02-16 02:57:44,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:57:44,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-16 02:57:44,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:57:44,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-16 02:57:44,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-02-16 02:57:44,160 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-16 02:57:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:57:44,470 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2023-02-16 02:57:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 02:57:44,471 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-16 02:57:44,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:57:44,473 INFO L225 Difference]: With dead ends: 255 [2023-02-16 02:57:44,473 INFO L226 Difference]: Without dead ends: 155 [2023-02-16 02:57:44,474 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-16 02:57:44,475 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 02:57:44,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 227 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 02:57:44,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-16 02:57:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2023-02-16 02:57:44,492 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-16 02:57:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2023-02-16 02:57:44,496 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2023-02-16 02:57:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:57:44,496 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2023-02-16 02:57:44,497 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-16 02:57:44,497 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2023-02-16 02:57:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-02-16 02:57:44,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:57:44,503 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-16 02:57:44,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 02:57:44,708 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-16 02:57:44,709 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:57:44,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:57:44,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1770426885, now seen corresponding path program 1 times [2023-02-16 02:57:44,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:57:44,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110602921] [2023-02-16 02:57:44,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:44,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:57:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:57:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-16 02:57:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:44,961 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-16 02:57:44,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:57:44,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110602921] [2023-02-16 02:57:44,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110602921] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:57:44,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115328671] [2023-02-16 02:57:44,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:44,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:57:44,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:57:44,963 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-16 02:57:44,965 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-16 02:57:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:45,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 02:57:45,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:57:45,110 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-16 02:57:45,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:57:45,773 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-16 02:57:45,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115328671] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:57:45,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:57:45,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2023-02-16 02:57:45,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55194687] [2023-02-16 02:57:45,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:57:45,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 02:57:45,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:57:45,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 02:57:45,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2023-02-16 02:57:45,776 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-16 02:57:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:57:46,126 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2023-02-16 02:57:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 02:57:46,127 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-16 02:57:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:57:46,128 INFO L225 Difference]: With dead ends: 240 [2023-02-16 02:57:46,128 INFO L226 Difference]: Without dead ends: 107 [2023-02-16 02:57:46,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 227 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2023-02-16 02:57:46,129 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 89 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 02:57:46,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 201 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 02:57:46,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-16 02:57:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2023-02-16 02:57:46,136 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-16 02:57:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2023-02-16 02:57:46,137 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 107 [2023-02-16 02:57:46,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:57:46,138 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2023-02-16 02:57:46,138 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-16 02:57:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2023-02-16 02:57:46,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-02-16 02:57:46,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:57:46,139 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-16 02:57:46,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-16 02:57:46,343 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-16 02:57:46,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:57:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:57:46,344 INFO L85 PathProgramCache]: Analyzing trace with hash -222615371, now seen corresponding path program 1 times [2023-02-16 02:57:46,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:57:46,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753271966] [2023-02-16 02:57:46,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:46,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:57:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:57:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-16 02:57:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-02-16 02:57:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-16 02:57:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,615 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-16 02:57:46,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:57:46,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753271966] [2023-02-16 02:57:46,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753271966] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:57:46,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180947359] [2023-02-16 02:57:46,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:46,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:57:46,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:57:46,617 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-16 02:57:46,619 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-16 02:57:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:46,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 02:57:46,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:57:46,791 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-16 02:57:46,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:57:47,757 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-16 02:57:47,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180947359] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:57:47,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:57:47,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 26 [2023-02-16 02:57:47,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510403451] [2023-02-16 02:57:47,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:57:47,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-16 02:57:47,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:57:47,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-16 02:57:47,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2023-02-16 02:57:47,760 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-16 02:57:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:57:48,177 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2023-02-16 02:57:48,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-16 02:57:48,178 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-16 02:57:48,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:57:48,179 INFO L225 Difference]: With dead ends: 214 [2023-02-16 02:57:48,179 INFO L226 Difference]: Without dead ends: 134 [2023-02-16 02:57:48,181 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-16 02:57:48,181 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 75 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 02:57:48,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 208 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 02:57:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-16 02:57:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2023-02-16 02:57:48,188 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-16 02:57:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2023-02-16 02:57:48,189 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 134 [2023-02-16 02:57:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:57:48,190 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2023-02-16 02:57:48,190 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-16 02:57:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2023-02-16 02:57:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2023-02-16 02:57:48,193 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:57:48,193 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-16 02:57:48,205 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-16 02:57:48,406 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-16 02:57:48,406 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:57:48,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:57:48,406 INFO L85 PathProgramCache]: Analyzing trace with hash 12289001, now seen corresponding path program 1 times [2023-02-16 02:57:48,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:57:48,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940211826] [2023-02-16 02:57:48,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:48,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:57:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:48,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:57:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:48,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:48,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:48,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:48,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:48,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:48,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:48,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:48,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:48,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:57:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-16 02:57:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:57:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-02-16 02:57:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:57:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-16 02:57:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:57:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,221 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-16 02:57:49,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:57:49,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940211826] [2023-02-16 02:57:49,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940211826] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:57:49,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822347564] [2023-02-16 02:57:49,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:49,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:57:49,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:57:49,223 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-16 02:57:49,225 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-16 02:57:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:49,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 02:57:49,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:57:49,499 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-16 02:57:49,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:57:51,058 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-16 02:57:51,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822347564] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:57:51,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:57:51,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 28 [2023-02-16 02:57:51,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616663452] [2023-02-16 02:57:51,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:57:51,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-16 02:57:51,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:57:51,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-16 02:57:51,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2023-02-16 02:57:51,061 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-16 02:57:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:57:51,563 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2023-02-16 02:57:51,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-16 02:57:51,564 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-16 02:57:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:57:51,566 INFO L225 Difference]: With dead ends: 260 [2023-02-16 02:57:51,566 INFO L226 Difference]: Without dead ends: 155 [2023-02-16 02:57:51,568 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-16 02:57:51,568 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 97 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 02:57:51,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 259 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 02:57:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-16 02:57:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2023-02-16 02:57:51,584 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-16 02:57:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2023-02-16 02:57:51,586 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 381 [2023-02-16 02:57:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:57:51,586 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2023-02-16 02:57:51,587 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-16 02:57:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2023-02-16 02:57:51,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2023-02-16 02:57:51,591 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:57:51,591 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 25, 25, 22, 22, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 10, 8, 7, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:57:51,599 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-16 02:57:51,797 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-16 02:57:51,797 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:57:51,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:57:51,797 INFO L85 PathProgramCache]: Analyzing trace with hash -854779469, now seen corresponding path program 2 times [2023-02-16 02:57:51,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:57:51,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002666658] [2023-02-16 02:57:51,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:51,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:57:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:57:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:57:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-02-16 02:57:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-02-16 02:57:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:57:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-02-16 02:57:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:57:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:57:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:52,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 245 proven. 607 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked. [2023-02-16 02:57:52,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:57:52,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002666658] [2023-02-16 02:57:52,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002666658] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:57:52,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401140382] [2023-02-16 02:57:52,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 02:57:52,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:57:52,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:57:52,584 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-16 02:57:52,619 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-16 02:57:52,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 02:57:52,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:57:52,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 02:57:52,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:57:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 139 proven. 904 refuted. 0 times theorem prover too weak. 3043 trivial. 0 not checked. [2023-02-16 02:57:52,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:57:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 139 proven. 937 refuted. 0 times theorem prover too weak. 3010 trivial. 0 not checked. [2023-02-16 02:57:54,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401140382] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:57:54,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:57:54,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 30 [2023-02-16 02:57:54,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020016222] [2023-02-16 02:57:54,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:57:54,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-16 02:57:54,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:57:54,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-16 02:57:54,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2023-02-16 02:57:54,910 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-16 02:57:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:57:55,478 INFO L93 Difference]: Finished difference Result 334 states and 594 transitions. [2023-02-16 02:57:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-16 02:57:55,479 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 378 [2023-02-16 02:57:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:57:55,481 INFO L225 Difference]: With dead ends: 334 [2023-02-16 02:57:55,481 INFO L226 Difference]: Without dead ends: 197 [2023-02-16 02:57:55,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 899 GetRequests, 843 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-16 02:57:55,483 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 123 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 02:57:55,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 221 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 02:57:55,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-16 02:57:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 173. [2023-02-16 02:57:55,491 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-16 02:57:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 272 transitions. [2023-02-16 02:57:55,492 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 272 transitions. Word has length 378 [2023-02-16 02:57:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:57:55,493 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 272 transitions. [2023-02-16 02:57:55,493 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-16 02:57:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 272 transitions. [2023-02-16 02:57:55,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2023-02-16 02:57:55,505 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:57:55,505 INFO L195 NwaCegarLoop]: trace histogram [49, 49, 48, 48, 40, 39, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 16, 15, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:57:55,523 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-16 02:57:55,711 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-16 02:57:55,711 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:57:55,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:57:55,712 INFO L85 PathProgramCache]: Analyzing trace with hash 7703838, now seen corresponding path program 3 times [2023-02-16 02:57:55,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:57:55,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607331126] [2023-02-16 02:57:55,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:55,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:57:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:57:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:57:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:56,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:57:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-02-16 02:57:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:57:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-02-16 02:57:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:57:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:57:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-02-16 02:57:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446 [2023-02-16 02:57:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:57:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:57:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-02-16 02:57:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:57:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:57:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:57:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:57:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:57:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12945 backedges. 487 proven. 1590 refuted. 0 times theorem prover too weak. 10868 trivial. 0 not checked. [2023-02-16 02:57:57,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:57:57,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607331126] [2023-02-16 02:57:57,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607331126] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:57:57,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918565834] [2023-02-16 02:57:57,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 02:57:57,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:57:57,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:57:57,289 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-16 02:57:57,320 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-16 02:57:57,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2023-02-16 02:57:57,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:57:57,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 02:57:57,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:57:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12945 backedges. 3513 proven. 63 refuted. 0 times theorem prover too weak. 9369 trivial. 0 not checked. [2023-02-16 02:57:57,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:57:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12945 backedges. 1385 proven. 191 refuted. 0 times theorem prover too weak. 11369 trivial. 0 not checked. [2023-02-16 02:57:59,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918565834] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:57:59,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:57:59,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 13] total 31 [2023-02-16 02:57:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898334597] [2023-02-16 02:57:59,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:57:59,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 02:57:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:57:59,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 02:57:59,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2023-02-16 02:57:59,250 INFO L87 Difference]: Start difference. First operand 173 states and 272 transitions. Second operand has 31 states, 30 states have (on average 3.533333333333333) internal successors, (106), 31 states have internal predecessors, (106), 17 states have call successors, (34), 2 states have call predecessors, (34), 12 states have return successors, (41), 23 states have call predecessors, (41), 17 states have call successors, (41) [2023-02-16 02:57:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:57:59,689 INFO L93 Difference]: Finished difference Result 369 states and 622 transitions. [2023-02-16 02:57:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-16 02:57:59,689 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.533333333333333) internal successors, (106), 31 states have internal predecessors, (106), 17 states have call successors, (34), 2 states have call predecessors, (34), 12 states have return successors, (41), 23 states have call predecessors, (41), 17 states have call successors, (41) Word has length 665 [2023-02-16 02:57:59,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:57:59,692 INFO L225 Difference]: With dead ends: 369 [2023-02-16 02:57:59,692 INFO L226 Difference]: Without dead ends: 199 [2023-02-16 02:57:59,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1554 GetRequests, 1506 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2023-02-16 02:57:59,694 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 110 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 02:57:59,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 343 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 02:57:59,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-16 02:57:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2023-02-16 02:57:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 131 states have (on average 1.1297709923664123) internal successors, (148), 127 states have internal predecessors, (148), 37 states have call successors, (37), 27 states have call predecessors, (37), 18 states have return successors, (96), 32 states have call predecessors, (96), 37 states have call successors, (96) [2023-02-16 02:57:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 281 transitions. [2023-02-16 02:57:59,706 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 281 transitions. Word has length 665 [2023-02-16 02:57:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:57:59,706 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 281 transitions. [2023-02-16 02:57:59,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.533333333333333) internal successors, (106), 31 states have internal predecessors, (106), 17 states have call successors, (34), 2 states have call predecessors, (34), 12 states have return successors, (41), 23 states have call predecessors, (41), 17 states have call successors, (41) [2023-02-16 02:57:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 281 transitions. [2023-02-16 02:57:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2023-02-16 02:57:59,710 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:57:59,710 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 50, 50, 42, 41, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 17, 15, 11, 9, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:57:59,724 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-16 02:57:59,917 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-16 02:57:59,917 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:57:59,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:57:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1928850223, now seen corresponding path program 4 times [2023-02-16 02:57:59,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:57:59,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671327397] [2023-02-16 02:57:59,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:57:59,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:57:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:00,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:58:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:00,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-16 02:58:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-16 02:58:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-16 02:58:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-16 02:58:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 2218 proven. 1615 refuted. 0 times theorem prover too weak. 10760 trivial. 0 not checked. [2023-02-16 02:58:01,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:58:01,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671327397] [2023-02-16 02:58:01,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671327397] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:58:01,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490770401] [2023-02-16 02:58:01,895 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 02:58:01,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:58:01,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:58:01,896 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-16 02:58:01,898 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-16 02:58:02,135 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 02:58:02,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:58:02,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-16 02:58:02,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:58:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 322 proven. 2039 refuted. 0 times theorem prover too weak. 12232 trivial. 0 not checked. [2023-02-16 02:58:02,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:58:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 322 proven. 2083 refuted. 0 times theorem prover too weak. 12188 trivial. 0 not checked. [2023-02-16 02:58:05,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490770401] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:58:05,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:58:05,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 14, 21] total 54 [2023-02-16 02:58:05,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453443757] [2023-02-16 02:58:05,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:58:05,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-16 02:58:05,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:58:05,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-16 02:58:05,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2488, Unknown=0, NotChecked=0, Total=2862 [2023-02-16 02:58:05,355 INFO L87 Difference]: Start difference. First operand 187 states and 281 transitions. Second operand has 54 states, 53 states have (on average 2.6037735849056602) internal successors, (138), 54 states have internal predecessors, (138), 35 states have call successors, (43), 1 states have call predecessors, (43), 25 states have return successors, (60), 38 states have call predecessors, (60), 35 states have call successors, (60) [2023-02-16 02:58:07,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:58:07,504 INFO L93 Difference]: Finished difference Result 520 states and 942 transitions. [2023-02-16 02:58:07,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-02-16 02:58:07,504 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.6037735849056602) internal successors, (138), 54 states have internal predecessors, (138), 35 states have call successors, (43), 1 states have call predecessors, (43), 25 states have return successors, (60), 38 states have call predecessors, (60), 35 states have call successors, (60) Word has length 705 [2023-02-16 02:58:07,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:58:07,507 INFO L225 Difference]: With dead ends: 520 [2023-02-16 02:58:07,508 INFO L226 Difference]: Without dead ends: 336 [2023-02-16 02:58:07,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1705 GetRequests, 1585 SyntacticMatches, 10 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4644 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1429, Invalid=11003, Unknown=0, NotChecked=0, Total=12432 [2023-02-16 02:58:07,511 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 280 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 3038 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 3649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 3038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-16 02:58:07,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 771 Invalid, 3649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 3038 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-16 02:58:07,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-02-16 02:58:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 274. [2023-02-16 02:58:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 197 states have (on average 1.0761421319796953) internal successors, (212), 189 states have internal predecessors, (212), 55 states have call successors, (55), 46 states have call predecessors, (55), 21 states have return successors, (122), 38 states have call predecessors, (122), 55 states have call successors, (122) [2023-02-16 02:58:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 389 transitions. [2023-02-16 02:58:07,525 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 389 transitions. Word has length 705 [2023-02-16 02:58:07,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:58:07,525 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 389 transitions. [2023-02-16 02:58:07,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.6037735849056602) internal successors, (138), 54 states have internal predecessors, (138), 35 states have call successors, (43), 1 states have call predecessors, (43), 25 states have return successors, (60), 38 states have call predecessors, (60), 35 states have call successors, (60) [2023-02-16 02:58:07,526 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 389 transitions. [2023-02-16 02:58:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1387 [2023-02-16 02:58:07,535 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:58:07,536 INFO L195 NwaCegarLoop]: trace histogram [103, 103, 100, 100, 82, 82, 51, 51, 51, 51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 50, 32, 31, 21, 18, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:58:07,543 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-16 02:58:07,743 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-16 02:58:07,744 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:58:07,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:58:07,744 INFO L85 PathProgramCache]: Analyzing trace with hash -809581903, now seen corresponding path program 5 times [2023-02-16 02:58:07,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:58:07,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524840427] [2023-02-16 02:58:07,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:58:07,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:58:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:08,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:58:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:09,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:10,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:10,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:10,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:10,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:10,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:10,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-16 02:58:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-02-16 02:58:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-16 02:58:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 636 [2023-02-16 02:58:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-16 02:58:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 922 [2023-02-16 02:58:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-16 02:58:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-16 02:58:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 57454 backedges. 1116 proven. 5582 refuted. 0 times theorem prover too weak. 50756 trivial. 0 not checked. [2023-02-16 02:58:11,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:58:11,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524840427] [2023-02-16 02:58:11,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524840427] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:58:11,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720831203] [2023-02-16 02:58:11,730 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-16 02:58:11,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:58:11,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:58:11,731 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-16 02:58:11,733 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-16 02:58:12,249 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2023-02-16 02:58:12,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:58:12,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 2512 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 02:58:12,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:58:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 57454 backedges. 22826 proven. 658 refuted. 0 times theorem prover too weak. 33970 trivial. 0 not checked. [2023-02-16 02:58:12,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:58:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 57454 backedges. 1362 proven. 5748 refuted. 0 times theorem prover too weak. 50344 trivial. 0 not checked. [2023-02-16 02:58:17,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720831203] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:58:17,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:58:17,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18, 25] total 47 [2023-02-16 02:58:17,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720640251] [2023-02-16 02:58:17,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:58:17,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-16 02:58:17,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:58:17,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-16 02:58:17,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1882, Unknown=0, NotChecked=0, Total=2162 [2023-02-16 02:58:17,420 INFO L87 Difference]: Start difference. First operand 274 states and 389 transitions. Second operand has 47 states, 46 states have (on average 3.152173913043478) internal successors, (145), 47 states have internal predecessors, (145), 35 states have call successors, (48), 2 states have call predecessors, (48), 19 states have return successors, (62), 28 states have call predecessors, (62), 35 states have call successors, (62) [2023-02-16 02:58:18,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:58:18,415 INFO L93 Difference]: Finished difference Result 588 states and 867 transitions. [2023-02-16 02:58:18,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-02-16 02:58:18,415 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.152173913043478) internal successors, (145), 47 states have internal predecessors, (145), 35 states have call successors, (48), 2 states have call predecessors, (48), 19 states have return successors, (62), 28 states have call predecessors, (62), 35 states have call successors, (62) Word has length 1386 [2023-02-16 02:58:18,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:58:18,418 INFO L225 Difference]: With dead ends: 588 [2023-02-16 02:58:18,418 INFO L226 Difference]: Without dead ends: 317 [2023-02-16 02:58:18,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3234 GetRequests, 3146 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2214 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=859, Invalid=5147, Unknown=0, NotChecked=0, Total=6006 [2023-02-16 02:58:18,421 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 244 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 02:58:18,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 477 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 02:58:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-02-16 02:58:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 258. [2023-02-16 02:58:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 185 states have (on average 1.0702702702702702) internal successors, (198), 179 states have internal predecessors, (198), 52 states have call successors, (52), 43 states have call predecessors, (52), 20 states have return successors, (114), 35 states have call predecessors, (114), 52 states have call successors, (114) [2023-02-16 02:58:18,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 364 transitions. [2023-02-16 02:58:18,435 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 364 transitions. Word has length 1386 [2023-02-16 02:58:18,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:58:18,435 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 364 transitions. [2023-02-16 02:58:18,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.152173913043478) internal successors, (145), 47 states have internal predecessors, (145), 35 states have call successors, (48), 2 states have call predecessors, (48), 19 states have return successors, (62), 28 states have call predecessors, (62), 35 states have call successors, (62) [2023-02-16 02:58:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 364 transitions. [2023-02-16 02:58:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2023-02-16 02:58:18,446 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:58:18,447 INFO L195 NwaCegarLoop]: trace histogram [111, 111, 108, 108, 89, 88, 55, 55, 55, 55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 34, 34, 23, 19, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:58:18,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-16 02:58:18,654 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-16 02:58:18,654 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:58:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:58:18,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1904196659, now seen corresponding path program 6 times [2023-02-16 02:58:18,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:58:18,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134581924] [2023-02-16 02:58:18,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:58:18,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:58:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:19,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:58:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:20,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:21,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:21,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:21,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:21,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-16 02:58:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-16 02:58:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-16 02:58:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-16 02:58:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2023-02-16 02:58:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 922 [2023-02-16 02:58:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-16 02:58:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-16 02:58:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2023-02-16 02:58:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 66940 backedges. 2713 proven. 5558 refuted. 0 times theorem prover too weak. 58669 trivial. 0 not checked. [2023-02-16 02:58:22,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:58:22,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134581924] [2023-02-16 02:58:22,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134581924] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:58:22,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989611654] [2023-02-16 02:58:22,960 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-16 02:58:22,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:58:22,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:58:22,981 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-16 02:58:22,982 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-16 02:58:23,356 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2023-02-16 02:58:23,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:58:23,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-16 02:58:23,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:58:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 66940 backedges. 1175 proven. 4106 refuted. 0 times theorem prover too weak. 61659 trivial. 0 not checked. [2023-02-16 02:58:23,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:58:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 66940 backedges. 1185 proven. 4136 refuted. 0 times theorem prover too weak. 61619 trivial. 0 not checked. [2023-02-16 02:58:28,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989611654] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:58:28,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:58:28,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 14, 21] total 47 [2023-02-16 02:58:28,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272900584] [2023-02-16 02:58:28,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:58:28,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-16 02:58:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:58:28,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-16 02:58:28,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1869, Unknown=0, NotChecked=0, Total=2162 [2023-02-16 02:58:28,173 INFO L87 Difference]: Start difference. First operand 258 states and 364 transitions. Second operand has 47 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 47 states have internal predecessors, (129), 33 states have call successors, (42), 1 states have call predecessors, (42), 21 states have return successors, (60), 37 states have call predecessors, (60), 33 states have call successors, (60) [2023-02-16 02:58:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:58:29,566 INFO L93 Difference]: Finished difference Result 595 states and 956 transitions. [2023-02-16 02:58:29,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-02-16 02:58:29,567 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 47 states have internal predecessors, (129), 33 states have call successors, (42), 1 states have call predecessors, (42), 21 states have return successors, (60), 37 states have call predecessors, (60), 33 states have call successors, (60) Word has length 1495 [2023-02-16 02:58:29,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:58:29,570 INFO L225 Difference]: With dead ends: 595 [2023-02-16 02:58:29,570 INFO L226 Difference]: Without dead ends: 283 [2023-02-16 02:58:29,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3480 GetRequests, 3401 SyntacticMatches, 10 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1967 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=658, Invalid=4312, Unknown=0, NotChecked=0, Total=4970 [2023-02-16 02:58:29,574 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 118 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 2913 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 2913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 02:58:29,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 951 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 2913 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-16 02:58:29,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-02-16 02:58:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 268. [2023-02-16 02:58:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 192 states have (on average 1.0520833333333333) internal successors, (202), 185 states have internal predecessors, (202), 55 states have call successors, (55), 46 states have call predecessors, (55), 20 states have return successors, (66), 36 states have call predecessors, (66), 55 states have call successors, (66) [2023-02-16 02:58:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 323 transitions. [2023-02-16 02:58:29,586 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 323 transitions. Word has length 1495 [2023-02-16 02:58:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:58:29,586 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 323 transitions. [2023-02-16 02:58:29,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 47 states have internal predecessors, (129), 33 states have call successors, (42), 1 states have call predecessors, (42), 21 states have return successors, (60), 37 states have call predecessors, (60), 33 states have call successors, (60) [2023-02-16 02:58:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 323 transitions. [2023-02-16 02:58:29,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2023-02-16 02:58:29,592 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:58:29,593 INFO L195 NwaCegarLoop]: trace histogram [76, 76, 75, 75, 61, 61, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 24, 23, 15, 14, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:58:29,601 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-16 02:58:29,802 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-16 02:58:29,802 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:58:29,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:58:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1241761113, now seen corresponding path program 7 times [2023-02-16 02:58:29,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:58:29,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339185216] [2023-02-16 02:58:29,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:58:29,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:58:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:30,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:58:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-16 02:58:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:31,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-16 02:58:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-16 02:58:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-16 02:58:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2023-02-16 02:58:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:58:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-16 02:58:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:58:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:58:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:58:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:58:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:58:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2682 proven. 2990 refuted. 0 times theorem prover too weak. 25964 trivial. 0 not checked. [2023-02-16 02:58:32,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:58:32,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339185216] [2023-02-16 02:58:32,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339185216] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:58:32,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458308498] [2023-02-16 02:58:32,615 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-16 02:58:32,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:58:32,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:58:32,616 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 02:58:32,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-16 02:58:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:58:33,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 2315 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 02:58:33,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:58:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2426 proven. 749 refuted. 0 times theorem prover too weak. 28461 trivial. 0 not checked. [2023-02-16 02:58:33,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:58:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2432 proven. 776 refuted. 0 times theorem prover too weak. 28428 trivial. 0 not checked. [2023-02-16 02:58:36,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458308498] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:58:36,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:58:36,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 13, 19] total 44 [2023-02-16 02:58:36,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720388379] [2023-02-16 02:58:36,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:58:36,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-16 02:58:36,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:58:36,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-16 02:58:36,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1619, Unknown=0, NotChecked=0, Total=1892 [2023-02-16 02:58:36,289 INFO L87 Difference]: Start difference. First operand 268 states and 323 transitions. Second operand has 44 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 44 states have internal predecessors, (114), 32 states have call successors, (39), 1 states have call predecessors, (39), 17 states have return successors, (56), 32 states have call predecessors, (56), 32 states have call successors, (56) [2023-02-16 02:58:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:58:37,046 INFO L93 Difference]: Finished difference Result 329 states and 396 transitions. [2023-02-16 02:58:37,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-16 02:58:37,047 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 44 states have internal predecessors, (114), 32 states have call successors, (39), 1 states have call predecessors, (39), 17 states have return successors, (56), 32 states have call predecessors, (56), 32 states have call successors, (56) Word has length 1032 [2023-02-16 02:58:37,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:58:37,049 INFO L225 Difference]: With dead ends: 329 [2023-02-16 02:58:37,049 INFO L226 Difference]: Without dead ends: 294 [2023-02-16 02:58:37,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2418 GetRequests, 2345 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1659 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=598, Invalid=3692, Unknown=0, NotChecked=0, Total=4290 [2023-02-16 02:58:37,051 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 186 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 02:58:37,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 503 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 02:58:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-02-16 02:58:37,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 256. [2023-02-16 02:58:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 183 states have (on average 1.0491803278688525) internal successors, (192), 176 states have internal predecessors, (192), 52 states have call successors, (52), 43 states have call predecessors, (52), 20 states have return successors, (56), 36 states have call predecessors, (56), 52 states have call successors, (56) [2023-02-16 02:58:37,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 300 transitions. [2023-02-16 02:58:37,063 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 300 transitions. Word has length 1032 [2023-02-16 02:58:37,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:58:37,064 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 300 transitions. [2023-02-16 02:58:37,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 44 states have internal predecessors, (114), 32 states have call successors, (39), 1 states have call predecessors, (39), 17 states have return successors, (56), 32 states have call predecessors, (56), 32 states have call successors, (56) [2023-02-16 02:58:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 300 transitions. [2023-02-16 02:58:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2023-02-16 02:58:37,072 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:58:37,072 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-16 02:58:37,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-16 02:58:37,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:58:37,279 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:58:37,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:58:37,280 INFO L85 PathProgramCache]: Analyzing trace with hash -553145382, now seen corresponding path program 8 times [2023-02-16 02:58:37,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:58:37,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454425804] [2023-02-16 02:58:37,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:58:37,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:58:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 02:58:37,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 02:58:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 02:58:37,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 02:58:37,756 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 02:58:37,757 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 02:58:37,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-16 02:58:37,765 INFO L445 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:58:37,770 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 02:58:37,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 02:58:37 BoogieIcfgContainer [2023-02-16 02:58:37,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 02:58:37,887 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 02:58:37,887 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 02:58:37,887 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 02:58:37,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:57:39" (3/4) ... [2023-02-16 02:58:37,888 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-16 02:58:37,993 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 02:58:37,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 02:58:37,994 INFO L158 Benchmark]: Toolchain (without parser) took 58751.25ms. Allocated memory was 125.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 84.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 110.2MB. Max. memory is 16.1GB. [2023-02-16 02:58:37,994 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory was 95.1MB in the beginning and 95.0MB in the end (delta: 81.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 02:58:37,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.87ms. Allocated memory is still 125.8MB. Free memory was 84.0MB in the beginning and 74.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 02:58:37,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.92ms. Allocated memory is still 125.8MB. Free memory was 74.0MB in the beginning and 72.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 02:58:37,995 INFO L158 Benchmark]: Boogie Preprocessor took 22.20ms. Allocated memory is still 125.8MB. Free memory was 72.6MB in the beginning and 71.7MB in the end (delta: 960.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 02:58:37,996 INFO L158 Benchmark]: RCFGBuilder took 189.80ms. Allocated memory is still 125.8MB. Free memory was 71.4MB in the beginning and 61.6MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 02:58:37,996 INFO L158 Benchmark]: TraceAbstraction took 58227.95ms. Allocated memory was 125.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 61.0MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 722.6MB. Max. memory is 16.1GB. [2023-02-16 02:58:37,996 INFO L158 Benchmark]: Witness Printer took 106.52ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-02-16 02:58:37,999 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.14ms. Allocated memory is still 125.8MB. Free memory was 95.1MB in the beginning and 95.0MB in the end (delta: 81.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.87ms. Allocated memory is still 125.8MB. Free memory was 84.0MB in the beginning and 74.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.92ms. Allocated memory is still 125.8MB. Free memory was 74.0MB in the beginning and 72.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.20ms. Allocated memory is still 125.8MB. Free memory was 72.6MB in the beginning and 71.7MB in the end (delta: 960.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 189.80ms. Allocated memory is still 125.8MB. Free memory was 71.4MB in the beginning and 61.6MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 58227.95ms. Allocated memory was 125.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 61.0MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 722.6MB. Max. memory is 16.1GB. * Witness Printer took 106.52ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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: 58.1s, OverallIterations: 17, TraceHistogramMax: 111, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.1s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1616 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1543 mSDsluCounter, 4927 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4359 mSDsCounter, 2399 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13446 IncrementalHoareTripleChecker+Invalid, 15845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2399 mSolverCounterUnsat, 568 mSDtfsCounter, 13446 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15269 GetRequests, 14553 SyntacticMatches, 87 SemanticMatches, 629 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13044 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=13, InterpolantAutomatonStates: 474, 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, 16 MinimizatonAttempts, 329 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 42.4s InterpolantComputationTime, 14138 NumberOfCodeBlocks, 12415 NumberOfCodeBlocksAsserted, 151 NumberOfCheckSat, 19339 ConstructedInterpolants, 0 QuantifiedInterpolants, 24591 SizeOfPredicates, 98 NumberOfNonLiveVariables, 10713 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 44 InterpolantComputations, 2 PerfectInterpolantSequences, 534320/577869 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-16 02:58:38,033 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