./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN --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 acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:26:17,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:26:17,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:26:17,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:26:17,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:26:17,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:26:17,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:26:17,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:26:17,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:26:17,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:26:17,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:26:17,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:26:17,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:26:17,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:26:17,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:26:17,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:26:17,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:26:17,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:26:17,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:26:17,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:26:17,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:26:17,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:26:17,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:26:17,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:26:17,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:26:17,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:26:17,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:26:17,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:26:17,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:26:17,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:26:17,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:26:17,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:26:17,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:26:17,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:26:17,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:26:17,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:26:17,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:26:17,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:26:17,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:26:17,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:26:17,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:26:17,258 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:26:17,292 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:26:17,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:26:17,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:26:17,293 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:26:17,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:26:17,293 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:26:17,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:26:17,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:26:17,301 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:26:17,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:26:17,302 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:26:17,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:26:17,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:26:17,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:26:17,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:26:17,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:26:17,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:26:17,303 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:26:17,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:26:17,304 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:26:17,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:26:17,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:26:17,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:26:17,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:26:17,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:26:17,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:26:17,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:26:17,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:26:17,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:26:17,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:26:17,306 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:26:17,306 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:26:17,307 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:26:17,307 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN 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 -> acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 [2022-11-20 11:26:17,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:26:17,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:26:17,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:26:17,646 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:26:17,662 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:26:17,663 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2022-11-20 11:26:20,668 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:26:20,890 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:26:20,890 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2022-11-20 11:26:20,901 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/data/9f225cbbb/e107c9d422ff4b79a356576501dd0064/FLAG17cad1348 [2022-11-20 11:26:20,916 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/data/9f225cbbb/e107c9d422ff4b79a356576501dd0064 [2022-11-20 11:26:20,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:26:20,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:26:20,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:26:20,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:26:20,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:26:20,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:26:20" (1/1) ... [2022-11-20 11:26:20,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e11881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:26:20, skipping insertion in model container [2022-11-20 11:26:20,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:26:20" (1/1) ... [2022-11-20 11:26:20,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:26:20,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:26:21,089 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2022-11-20 11:26:21,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:26:21,103 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:26:21,117 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2022-11-20 11:26:21,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:26:21,130 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:26:21,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:26:21 WrapperNode [2022-11-20 11:26:21,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:26:21,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:26:21,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:26:21,131 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:26:21,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:26:21" (1/1) ... [2022-11-20 11:26:21,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:26:21" (1/1) ... [2022-11-20 11:26:21,162 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-11-20 11:26:21,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:26:21,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:26:21,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:26:21,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:26:21,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:26:21" (1/1) ... [2022-11-20 11:26:21,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:26:21" (1/1) ... [2022-11-20 11:26:21,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:26:21" (1/1) ... [2022-11-20 11:26:21,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:26:21" (1/1) ... [2022-11-20 11:26:21,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:26:21" (1/1) ... [2022-11-20 11:26:21,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:26:21" (1/1) ... [2022-11-20 11:26:21,179 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:26:21" (1/1) ... [2022-11-20 11:26:21,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:26:21" (1/1) ... [2022-11-20 11:26:21,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:26:21,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:26:21,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:26:21,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:26:21,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:26:21" (1/1) ... [2022-11-20 11:26:21,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:26:21,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:21,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:26:21,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:26:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:26:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:26:21,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:26:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:26:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2022-11-20 11:26:21,253 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2022-11-20 11:26:21,331 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:26:21,333 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:26:21,505 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:26:21,510 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:26:21,511 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 11:26:21,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:26:21 BoogieIcfgContainer [2022-11-20 11:26:21,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:26:21,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:26:21,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:26:21,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:26:21,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:26:20" (1/3) ... [2022-11-20 11:26:21,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6e36ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:26:21, skipping insertion in model container [2022-11-20 11:26:21,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:26:21" (2/3) ... [2022-11-20 11:26:21,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6e36ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:26:21, skipping insertion in model container [2022-11-20 11:26:21,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:26:21" (3/3) ... [2022-11-20 11:26:21,531 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2022-11-20 11:26:21,551 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:26:21,551 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:26:21,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:26:21,711 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;@2b2eab84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:26:21,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:26:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:26:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 11:26:21,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:21,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:21,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:21,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:21,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2022-11-20 11:26:21,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:21,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134675189] [2022-11-20 11:26:21,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:21,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:22,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:26:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:26:22,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:22,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134675189] [2022-11-20 11:26:22,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134675189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:26:22,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:26:22,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:26:22,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264395541] [2022-11-20 11:26:22,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:26:22,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:26:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:22,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:26:22,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:26:22,164 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 11:26:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:22,219 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-11-20 11:26:22,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:26:22,222 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 [2022-11-20 11:26:22,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:22,230 INFO L225 Difference]: With dead ends: 34 [2022-11-20 11:26:22,230 INFO L226 Difference]: Without dead ends: 18 [2022-11-20 11:26:22,233 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 [2022-11-20 11:26:22,236 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 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 [2022-11-20 11:26:22,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:26:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-20 11:26:22,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-20 11:26:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 11:26:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-20 11:26:22,300 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-11-20 11:26:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:22,300 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-20 11:26:22,301 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) [2022-11-20 11:26:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-20 11:26:22,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:26:22,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:22,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:22,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:26:22,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:22,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:22,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2022-11-20 11:26:22,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:22,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335818161] [2022-11-20 11:26:22,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:22,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:22,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:26:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:26:22,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:22,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335818161] [2022-11-20 11:26:22,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335818161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:26:22,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:26:22,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:26:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886519306] [2022-11-20 11:26:22,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:26:22,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:26:22,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:22,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:26:22,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:26:22,449 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 11:26:22,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:22,477 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-11-20 11:26:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:26:22,478 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 [2022-11-20 11:26:22,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:22,479 INFO L225 Difference]: With dead ends: 24 [2022-11-20 11:26:22,479 INFO L226 Difference]: Without dead ends: 20 [2022-11-20 11:26:22,480 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 [2022-11-20 11:26:22,481 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 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 [2022-11-20 11:26:22,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:26:22,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-20 11:26:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-11-20 11:26:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 11:26:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-20 11:26:22,488 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-11-20 11:26:22,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:22,488 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-20 11:26:22,489 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) [2022-11-20 11:26:22,489 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-20 11:26:22,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 11:26:22,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:22,490 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:22,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:26:22,491 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:22,492 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2022-11-20 11:26:22,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:22,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755369140] [2022-11-20 11:26:22,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:22,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:22,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:26:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:22,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:22,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 11:26:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:26:22,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:22,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755369140] [2022-11-20 11:26:22,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755369140] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:22,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112310479] [2022-11-20 11:26:22,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:22,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:22,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:22,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:26:22,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:26:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:22,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:26:22,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:26:22,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:26:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:26:23,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112310479] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:26:23,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:26:23,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-11-20 11:26:23,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492644258] [2022-11-20 11:26:23,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:23,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:26:23,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:23,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:26:23,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:26:23,181 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-20 11:26:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:23,307 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-11-20 11:26:23,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:26:23,308 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2022-11-20 11:26:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:23,309 INFO L225 Difference]: With dead ends: 35 [2022-11-20 11:26:23,309 INFO L226 Difference]: Without dead ends: 20 [2022-11-20 11:26:23,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:26:23,311 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:23,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 48 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:26:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-20 11:26:23,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-20 11:26:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 11:26:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-11-20 11:26:23,320 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2022-11-20 11:26:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:23,320 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-11-20 11:26:23,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-20 11:26:23,321 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-11-20 11:26:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:26:23,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:23,323 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:23,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:23,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:23,529 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:23,530 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2022-11-20 11:26:23,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:23,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769451069] [2022-11-20 11:26:23,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:23,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:23,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:26:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:23,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:23,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:26:23,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:23,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769451069] [2022-11-20 11:26:23,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769451069] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:23,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579063219] [2022-11-20 11:26:23,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:23,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:23,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:23,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:26:23,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:26:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:23,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:26:23,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:26:23,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:26:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:26:24,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579063219] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:26:24,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:26:24,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-11-20 11:26:24,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486285713] [2022-11-20 11:26:24,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:24,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:26:24,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:24,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:26:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:26:24,167 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 11:26:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:24,272 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-11-20 11:26:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:26:24,273 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2022-11-20 11:26:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:24,280 INFO L225 Difference]: With dead ends: 38 [2022-11-20 11:26:24,280 INFO L226 Difference]: Without dead ends: 34 [2022-11-20 11:26:24,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:26:24,284 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:24,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 62 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:26:24,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-20 11:26:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-20 11:26:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-20 11:26:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-11-20 11:26:24,305 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2022-11-20 11:26:24,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:24,305 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-11-20 11:26:24,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 11:26:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-11-20 11:26:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 11:26:24,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:24,307 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:24,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:24,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:24,508 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:24,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:24,509 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2022-11-20 11:26:24,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:24,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031562169] [2022-11-20 11:26:24,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:24,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:24,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:26:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:24,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:24,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:24,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:24,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 11:26:24,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:24,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031562169] [2022-11-20 11:26:24,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031562169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:24,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098410188] [2022-11-20 11:26:24,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:26:24,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:24,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:24,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:26:24,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:26:24,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:26:24,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:26:24,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:26:24,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-20 11:26:24,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:26:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-20 11:26:25,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098410188] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:26:25,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:26:25,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2022-11-20 11:26:25,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414595756] [2022-11-20 11:26:25,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:25,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 11:26:25,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:25,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 11:26:25,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:26:25,322 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2022-11-20 11:26:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:25,586 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2022-11-20 11:26:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:26:25,587 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2022-11-20 11:26:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:25,590 INFO L225 Difference]: With dead ends: 69 [2022-11-20 11:26:25,590 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 11:26:25,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-11-20 11:26:25,592 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:25,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 77 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:26:25,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 11:26:25,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-20 11:26:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-20 11:26:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-11-20 11:26:25,606 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-11-20 11:26:25,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:25,606 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-11-20 11:26:25,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2022-11-20 11:26:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-11-20 11:26:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 11:26:25,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:25,613 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:25,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:25,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:25,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:25,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:25,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2022-11-20 11:26:25,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:25,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979821254] [2022-11-20 11:26:25,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:25,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:25,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:26:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:25,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:26,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:26,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:26,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:26,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:26,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:26,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-20 11:26:26,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:26,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979821254] [2022-11-20 11:26:26,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979821254] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:26,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030379488] [2022-11-20 11:26:26,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:26:26,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:26,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:26,168 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:26:26,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:26:26,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 11:26:26,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:26:26,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:26:26,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-11-20 11:26:26,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:26:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-20 11:26:26,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030379488] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:26:26,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:26:26,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 17 [2022-11-20 11:26:26,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659435408] [2022-11-20 11:26:26,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:26,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 11:26:26,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:26,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 11:26:26,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:26:26,681 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2022-11-20 11:26:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:26,836 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2022-11-20 11:26:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:26:26,837 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) Word has length 65 [2022-11-20 11:26:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:26,839 INFO L225 Difference]: With dead ends: 85 [2022-11-20 11:26:26,839 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 11:26:26,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2022-11-20 11:26:26,841 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:26,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 67 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:26:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 11:26:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-11-20 11:26:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2022-11-20 11:26:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-11-20 11:26:26,850 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2022-11-20 11:26:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:26,851 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2022-11-20 11:26:26,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2022-11-20 11:26:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-11-20 11:26:26,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-20 11:26:26,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:26,854 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:26,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:27,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 11:26:27,060 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:27,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2022-11-20 11:26:27,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:27,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072319728] [2022-11-20 11:26:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:26:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2022-11-20 11:26:27,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:27,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072319728] [2022-11-20 11:26:27,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072319728] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:27,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338403402] [2022-11-20 11:26:27,762 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:26:27,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:27,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:27,763 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:26:27,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:26:27,871 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:26:27,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:26:27,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:26:27,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2022-11-20 11:26:27,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:26:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 403 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2022-11-20 11:26:28,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338403402] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:26:28,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:26:28,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13] total 20 [2022-11-20 11:26:28,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65109772] [2022-11-20 11:26:28,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:28,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 11:26:28,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:28,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 11:26:28,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2022-11-20 11:26:28,996 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2022-11-20 11:26:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:29,202 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2022-11-20 11:26:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:26:29,205 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) Word has length 147 [2022-11-20 11:26:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:29,208 INFO L225 Difference]: With dead ends: 117 [2022-11-20 11:26:29,208 INFO L226 Difference]: Without dead ends: 113 [2022-11-20 11:26:29,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 323 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2022-11-20 11:26:29,209 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 132 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:29,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 70 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:26:29,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-20 11:26:29,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2022-11-20 11:26:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 68 states have internal predecessors, (82), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (56), 26 states have call predecessors, (56), 21 states have call successors, (56) [2022-11-20 11:26:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2022-11-20 11:26:29,231 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2022-11-20 11:26:29,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:29,232 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2022-11-20 11:26:29,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2022-11-20 11:26:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2022-11-20 11:26:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-11-20 11:26:29,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:29,241 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:29,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:29,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 11:26:29,447 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:29,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:29,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2022-11-20 11:26:29,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:29,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216167133] [2022-11-20 11:26:29,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:29,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:29,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:26:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:29,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:26:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2022-11-20 11:26:30,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:30,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216167133] [2022-11-20 11:26:30,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216167133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:30,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530618253] [2022-11-20 11:26:30,591 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 11:26:30,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:30,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:30,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:26:30,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:26:30,736 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-11-20 11:26:30,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:26:30,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 11:26:30,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2022-11-20 11:26:30,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:26:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 632 proven. 605 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2022-11-20 11:26:33,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530618253] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:26:33,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:26:33,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 21] total 34 [2022-11-20 11:26:33,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222541236] [2022-11-20 11:26:33,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:33,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-20 11:26:33,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:33,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 11:26:33,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 11:26:33,064 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) [2022-11-20 11:26:33,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:33,679 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2022-11-20 11:26:33,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 11:26:33,680 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) Word has length 215 [2022-11-20 11:26:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:33,682 INFO L225 Difference]: With dead ends: 193 [2022-11-20 11:26:33,682 INFO L226 Difference]: Without dead ends: 95 [2022-11-20 11:26:33,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 468 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=650, Invalid=2002, Unknown=0, NotChecked=0, Total=2652 [2022-11-20 11:26:33,685 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 203 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:33,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 172 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:26:33,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-20 11:26:33,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2022-11-20 11:26:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 58 states have internal predecessors, (62), 15 states have call successors, (15), 12 states have call predecessors, (15), 8 states have return successors, (36), 13 states have call predecessors, (36), 15 states have call successors, (36) [2022-11-20 11:26:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2022-11-20 11:26:33,698 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2022-11-20 11:26:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:33,699 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2022-11-20 11:26:33,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) [2022-11-20 11:26:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2022-11-20 11:26:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-11-20 11:26:33,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:33,704 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:33,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:33,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:33,911 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:33,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 6 times [2022-11-20 11:26:33,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:33,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388667455] [2022-11-20 11:26:33,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:33,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:34,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:26:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:34,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:34,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:34,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:34,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:34,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:26:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 11:26:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2022-11-20 11:26:35,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:35,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388667455] [2022-11-20 11:26:35,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388667455] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:35,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085933289] [2022-11-20 11:26:35,217 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 11:26:35,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:35,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:35,218 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:26:35,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:26:35,379 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2022-11-20 11:26:35,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:26:35,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 11:26:35,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 331 proven. 821 refuted. 0 times theorem prover too weak. 3416 trivial. 0 not checked. [2022-11-20 11:26:35,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:26:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 335 proven. 857 refuted. 0 times theorem prover too weak. 3376 trivial. 0 not checked. [2022-11-20 11:26:37,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085933289] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:26:37,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:26:37,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 15] total 25 [2022-11-20 11:26:37,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883766754] [2022-11-20 11:26:37,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:37,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 11:26:37,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:37,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 11:26:37,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2022-11-20 11:26:37,196 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) [2022-11-20 11:26:37,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:37,461 INFO L93 Difference]: Finished difference Result 266 states and 398 transitions. [2022-11-20 11:26:37,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 11:26:37,462 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) Word has length 283 [2022-11-20 11:26:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:37,466 INFO L225 Difference]: With dead ends: 266 [2022-11-20 11:26:37,466 INFO L226 Difference]: Without dead ends: 262 [2022-11-20 11:26:37,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 633 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=437, Unknown=0, NotChecked=0, Total=650 [2022-11-20 11:26:37,468 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 170 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:37,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 102 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:26:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-20 11:26:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 247. [2022-11-20 11:26:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 170 states have (on average 1.035294117647059) internal successors, (176), 165 states have internal predecessors, (176), 52 states have call successors, (52), 31 states have call predecessors, (52), 24 states have return successors, (140), 50 states have call predecessors, (140), 52 states have call successors, (140) [2022-11-20 11:26:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 368 transitions. [2022-11-20 11:26:37,497 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 368 transitions. Word has length 283 [2022-11-20 11:26:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:37,498 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 368 transitions. [2022-11-20 11:26:37,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) [2022-11-20 11:26:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 368 transitions. [2022-11-20 11:26:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2022-11-20 11:26:37,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:37,511 INFO L195 NwaCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:37,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:37,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:37,718 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:37,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:37,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1042599522, now seen corresponding path program 7 times [2022-11-20 11:26:37,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:37,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361574590] [2022-11-20 11:26:37,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:37,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:38,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:26:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:39,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:39,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:39,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:39,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:26:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 11:26:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-20 11:26:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:26:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:40,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:41,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:41,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 11:26:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:41,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:41,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:41,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:41,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:41,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:41,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:41,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2022-11-20 11:26:41,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:41,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361574590] [2022-11-20 11:26:41,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361574590] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:41,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855610146] [2022-11-20 11:26:41,133 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 11:26:41,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:41,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:41,134 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:26:41,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:26:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:41,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 11:26:41,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 386 proven. 2689 refuted. 0 times theorem prover too weak. 13332 trivial. 0 not checked. [2022-11-20 11:26:41,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:26:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 386 proven. 2766 refuted. 0 times theorem prover too weak. 13255 trivial. 0 not checked. [2022-11-20 11:26:45,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855610146] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:26:45,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:26:45,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 12, 19] total 38 [2022-11-20 11:26:45,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056887187] [2022-11-20 11:26:45,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:45,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 11:26:45,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:45,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 11:26:45,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2022-11-20 11:26:45,148 INFO L87 Difference]: Start difference. First operand 247 states and 368 transitions. Second operand has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) [2022-11-20 11:26:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:46,000 INFO L93 Difference]: Finished difference Result 388 states and 667 transitions. [2022-11-20 11:26:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-20 11:26:46,001 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) Word has length 528 [2022-11-20 11:26:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:46,003 INFO L225 Difference]: With dead ends: 388 [2022-11-20 11:26:46,004 INFO L226 Difference]: Without dead ends: 152 [2022-11-20 11:26:46,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1266 GetRequests, 1199 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=873, Invalid=2787, Unknown=0, NotChecked=0, Total=3660 [2022-11-20 11:26:46,007 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 223 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:46,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 227 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:26:46,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-20 11:26:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 122. [2022-11-20 11:26:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.0344827586206897) internal successors, (90), 85 states have internal predecessors, (90), 24 states have call successors, (24), 19 states have call predecessors, (24), 10 states have return successors, (58), 17 states have call predecessors, (58), 24 states have call successors, (58) [2022-11-20 11:26:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2022-11-20 11:26:46,020 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 528 [2022-11-20 11:26:46,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:46,021 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2022-11-20 11:26:46,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) [2022-11-20 11:26:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2022-11-20 11:26:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2022-11-20 11:26:46,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:46,052 INFO L195 NwaCegarLoop]: trace histogram [125, 125, 101, 62, 62, 62, 62, 62, 62, 62, 39, 24, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:46,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:46,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:46,260 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:46,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:46,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1121911956, now seen corresponding path program 8 times [2022-11-20 11:26:46,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:46,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269913405] [2022-11-20 11:26:46,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:46,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:48,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:26:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:49,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:49,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:26:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 11:26:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-20 11:26:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:26:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:50,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-11-20 11:26:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:26:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 11:26:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-20 11:26:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:26:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:26:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:51,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:52,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:26:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:52,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:26:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 5753 proven. 5825 refuted. 0 times theorem prover too weak. 32036 trivial. 0 not checked. [2022-11-20 11:26:52,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:52,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269913405] [2022-11-20 11:26:52,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269913405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:52,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984491384] [2022-11-20 11:26:52,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:26:52,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:52,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:52,015 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:26:52,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 11:26:52,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:26:52,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:26:52,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 11:26:52,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 699 proven. 5145 refuted. 0 times theorem prover too weak. 37770 trivial. 0 not checked. [2022-11-20 11:26:52,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:26:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 699 proven. 5245 refuted. 0 times theorem prover too weak. 37670 trivial. 0 not checked. [2022-11-20 11:26:57,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984491384] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:26:57,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:26:57,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 13, 21] total 42 [2022-11-20 11:26:57,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390324227] [2022-11-20 11:26:57,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:57,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 11:26:57,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:57,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 11:26:57,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=1306, Unknown=0, NotChecked=0, Total=1722 [2022-11-20 11:26:57,628 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) [2022-11-20 11:26:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:58,624 INFO L93 Difference]: Finished difference Result 270 states and 462 transitions. [2022-11-20 11:26:58,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-20 11:26:58,625 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) Word has length 855 [2022-11-20 11:26:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:58,628 INFO L225 Difference]: With dead ends: 270 [2022-11-20 11:26:58,629 INFO L226 Difference]: Without dead ends: 163 [2022-11-20 11:26:58,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2026 GetRequests, 1949 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1113, Invalid=3579, Unknown=0, NotChecked=0, Total=4692 [2022-11-20 11:26:58,632 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 369 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:58,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 222 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:26:58,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-20 11:26:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2022-11-20 11:26:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 97 states have internal predecessors, (102), 28 states have call successors, (28), 22 states have call predecessors, (28), 11 states have return successors, (71), 19 states have call predecessors, (71), 28 states have call successors, (71) [2022-11-20 11:26:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2022-11-20 11:26:58,663 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 855 [2022-11-20 11:26:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:58,667 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2022-11-20 11:26:58,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) [2022-11-20 11:26:58,668 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2022-11-20 11:26:58,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1564 [2022-11-20 11:26:58,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:58,689 INFO L195 NwaCegarLoop]: trace histogram [229, 229, 185, 114, 114, 114, 114, 114, 114, 114, 71, 44, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:58,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:58,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:58,912 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:58,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:58,914 INFO L85 PathProgramCache]: Analyzing trace with hash 35450340, now seen corresponding path program 9 times [2022-11-20 11:26:58,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:58,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916729468] [2022-11-20 11:26:58,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:58,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:02,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:27:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:04,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:05,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:05,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:27:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:27:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 11:27:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:27:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-20 11:27:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:27:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:27:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-11-20 11:27:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:27:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:27:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 11:27:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:27:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2022-11-20 11:27:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:27:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:08,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:27:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 11:27:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:27:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-20 11:27:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:27:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:27:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-11-20 11:27:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:27:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:27:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 636 [2022-11-20 11:27:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:27:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:27:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:27:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:27:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:27:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 13165 proven. 14022 refuted. 0 times theorem prover too weak. 120021 trivial. 0 not checked. [2022-11-20 11:27:09,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:27:09,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916729468] [2022-11-20 11:27:09,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916729468] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:27:09,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731708446] [2022-11-20 11:27:09,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:27:09,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:27:09,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:27:09,647 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:27:09,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 11:27:10,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 108 check-sat command(s) [2022-11-20 11:27:10,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:27:10,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 11:27:10,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:27:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 10746 proven. 1070 refuted. 0 times theorem prover too weak. 135392 trivial. 0 not checked. [2022-11-20 11:27:10,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:27:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 10746 proven. 1120 refuted. 0 times theorem prover too weak. 135342 trivial. 0 not checked. [2022-11-20 11:27:16,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731708446] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:27:16,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:27:16,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14, 21] total 48 [2022-11-20 11:27:16,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366599714] [2022-11-20 11:27:16,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:27:16,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-20 11:27:16,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:27:16,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-20 11:27:16,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=1755, Unknown=0, NotChecked=0, Total=2256 [2022-11-20 11:27:16,791 INFO L87 Difference]: Start difference. First operand 139 states and 201 transitions. Second operand has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) [2022-11-20 11:27:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:18,063 INFO L93 Difference]: Finished difference Result 319 states and 564 transitions. [2022-11-20 11:27:18,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-20 11:27:18,063 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) Word has length 1563 [2022-11-20 11:27:18,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:18,068 INFO L225 Difference]: With dead ends: 319 [2022-11-20 11:27:18,068 INFO L226 Difference]: Without dead ends: 195 [2022-11-20 11:27:18,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3665 GetRequests, 3574 SyntacticMatches, 10 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2398 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1446, Invalid=5360, Unknown=0, NotChecked=0, Total=6806 [2022-11-20 11:27:18,080 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 376 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:18,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 277 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [619 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:27:18,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-20 11:27:18,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2022-11-20 11:27:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 112 states have (on average 1.0267857142857142) internal successors, (115), 110 states have internal predecessors, (115), 33 states have call successors, (33), 26 states have call predecessors, (33), 11 states have return successors, (84), 20 states have call predecessors, (84), 33 states have call successors, (84) [2022-11-20 11:27:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2022-11-20 11:27:18,103 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 1563 [2022-11-20 11:27:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:18,105 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2022-11-20 11:27:18,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) [2022-11-20 11:27:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2022-11-20 11:27:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2022-11-20 11:27:18,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:18,148 INFO L195 NwaCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:27:18,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 11:27:18,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 11:27:18,356 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:27:18,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 10 times [2022-11-20 11:27:18,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:27:18,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062813494] [2022-11-20 11:27:18,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:27:18,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:27:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:27:18,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:27:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:27:18,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:27:18,861 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:27:18,862 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 11:27:18,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:27:18,866 INFO L444 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2022-11-20 11:27:18,872 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:27:19,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:27:19 BoogieIcfgContainer [2022-11-20 11:27:19,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:27:19,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:27:19,116 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:27:19,116 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:27:19,117 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:26:21" (3/4) ... [2022-11-20 11:27:19,121 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 11:27:19,319 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 11:27:19,320 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:27:19,320 INFO L158 Benchmark]: Toolchain (without parser) took 58398.09ms. Allocated memory was 161.5MB in the beginning and 872.4MB in the end (delta: 710.9MB). Free memory was 130.8MB in the beginning and 546.7MB in the end (delta: -415.9MB). Peak memory consumption was 295.2MB. Max. memory is 16.1GB. [2022-11-20 11:27:19,321 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 119.5MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:27:19,321 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.94ms. Allocated memory is still 161.5MB. Free memory was 130.8MB in the beginning and 121.2MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 11:27:19,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.22ms. Allocated memory is still 161.5MB. Free memory was 121.2MB in the beginning and 119.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:27:19,322 INFO L158 Benchmark]: Boogie Preprocessor took 17.88ms. Allocated memory is still 161.5MB. Free memory was 119.8MB in the beginning and 119.0MB in the end (delta: 724.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:27:19,322 INFO L158 Benchmark]: RCFGBuilder took 331.36ms. Allocated memory is still 161.5MB. Free memory was 118.3MB in the beginning and 109.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 11:27:19,323 INFO L158 Benchmark]: TraceAbstraction took 57600.22ms. Allocated memory was 161.5MB in the beginning and 872.4MB in the end (delta: 710.9MB). Free memory was 108.6MB in the beginning and 572.1MB in the end (delta: -463.6MB). Peak memory consumption was 247.0MB. Max. memory is 16.1GB. [2022-11-20 11:27:19,323 INFO L158 Benchmark]: Witness Printer took 204.17ms. Allocated memory is still 872.4MB. Free memory was 572.1MB in the beginning and 546.7MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 11:27:19,325 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.26ms. Allocated memory is still 119.5MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.94ms. Allocated memory is still 161.5MB. Free memory was 130.8MB in the beginning and 121.2MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.22ms. Allocated memory is still 161.5MB. Free memory was 121.2MB in the beginning and 119.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.88ms. Allocated memory is still 161.5MB. Free memory was 119.8MB in the beginning and 119.0MB in the end (delta: 724.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.36ms. Allocated memory is still 161.5MB. Free memory was 118.3MB in the beginning and 109.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 57600.22ms. Allocated memory was 161.5MB in the beginning and 872.4MB in the end (delta: 710.9MB). Free memory was 108.6MB in the beginning and 572.1MB in the end (delta: -463.6MB). Peak memory consumption was 247.0MB. Max. memory is 16.1GB. * Witness Printer took 204.17ms. Allocated memory is still 872.4MB. Free memory was 572.1MB in the beginning and 546.7MB in the end (delta: 25.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: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 10; VAL [x=10] [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [fibo(x)=55, x=10] [L27] int result = fibo(x); [L28] COND TRUE result == 55 VAL [result=55, x=10] [L29] reach_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.2s, OverallIterations: 13, TraceHistogramMax: 229, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.1s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1740 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1671 mSDsluCounter, 1473 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1199 mSDsCounter, 2317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3183 IncrementalHoareTripleChecker+Invalid, 5500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2317 mSolverCounterUnsat, 274 mSDtfsCounter, 3183 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8889 GetRequests, 8462 SyntacticMatches, 59 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7210 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=9, InterpolantAutomatonStates: 250, 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, 12 MinimizatonAttempts, 132 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 45.6s InterpolantComputationTime, 8710 NumberOfCodeBlocks, 7850 NumberOfCodeBlocksAsserted, 178 NumberOfCheckSat, 11209 ConstructedInterpolants, 0 QuantifiedInterpolants, 15460 SizeOfPredicates, 56 NumberOfNonLiveVariables, 6571 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 600612/647382 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! [2022-11-20 11:27:19,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd2691-a54f-43ed-88b4-40c2bc18c47b/bin/uautomizer-ug76WZFUDN/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