./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 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro --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-8393723 [2022-11-18 19:33:26,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:33:26,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:33:26,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:33:26,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:33:26,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:33:26,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:33:26,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:33:26,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:33:26,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:33:26,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:33:26,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:33:26,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:33:26,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:33:26,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:33:26,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:33:26,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:33:26,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:33:26,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:33:26,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:33:26,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:33:26,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:33:26,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:33:26,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:33:26,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:33:26,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:33:26,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:33:26,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:33:26,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:33:26,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:33:26,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:33:26,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:33:26,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:33:26,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:33:26,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:33:26,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:33:26,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:33:26,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:33:26,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:33:26,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:33:26,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:33:26,328 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:33:26,370 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:33:26,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:33:26,371 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:33:26,372 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:33:26,372 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:33:26,373 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:33:26,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:33:26,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:33:26,375 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:33:26,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:33:26,376 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:33:26,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:33:26,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:33:26,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:33:26,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:33:26,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:33:26,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:33:26,378 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:33:26,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:33:26,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:33:26,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:33:26,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:33:26,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:33:26,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:33:26,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:33:26,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:33:26,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:33:26,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:33:26,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:33:26,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:33:26,382 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:33:26,382 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:33:26,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:33:26,383 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_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/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_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro 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-18 19:33:26,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:33:26,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:33:26,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:33:26,742 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:33:26,743 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:33:26,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2022-11-18 19:33:26,837 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/data/5d1470301/9a33b7c52fb54cce938df2052b002626/FLAG3e9df1973 [2022-11-18 19:33:27,355 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:33:27,356 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2022-11-18 19:33:27,363 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/data/5d1470301/9a33b7c52fb54cce938df2052b002626/FLAG3e9df1973 [2022-11-18 19:33:27,730 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/data/5d1470301/9a33b7c52fb54cce938df2052b002626 [2022-11-18 19:33:27,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:33:27,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:33:27,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:33:27,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:33:27,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:33:27,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:33:27" (1/1) ... [2022-11-18 19:33:27,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d4ed2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:27, skipping insertion in model container [2022-11-18 19:33:27,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:33:27" (1/1) ... [2022-11-18 19:33:27,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:33:27,767 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:33:27,932 WARN L234 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_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2022-11-18 19:33:27,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:33:27,950 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:33:27,973 WARN L234 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_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2022-11-18 19:33:27,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:33:27,991 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:33:27,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:27 WrapperNode [2022-11-18 19:33:27,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:33:27,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:33:27,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:33:27,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:33:28,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:27" (1/1) ... [2022-11-18 19:33:28,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:27" (1/1) ... [2022-11-18 19:33:28,030 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-11-18 19:33:28,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:33:28,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:33:28,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:33:28,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:33:28,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:27" (1/1) ... [2022-11-18 19:33:28,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:27" (1/1) ... [2022-11-18 19:33:28,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:27" (1/1) ... [2022-11-18 19:33:28,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:27" (1/1) ... [2022-11-18 19:33:28,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:27" (1/1) ... [2022-11-18 19:33:28,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:27" (1/1) ... [2022-11-18 19:33:28,056 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:27" (1/1) ... [2022-11-18 19:33:28,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:27" (1/1) ... [2022-11-18 19:33:28,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:33:28,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:33:28,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:33:28,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:33:28,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:27" (1/1) ... [2022-11-18 19:33:28,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:33:28,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:28,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:33:28,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:33:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:33:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:33:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:33:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:33:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2022-11-18 19:33:28,155 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2022-11-18 19:33:28,217 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:33:28,219 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:33:28,394 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:33:28,400 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:33:28,400 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:33:28,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:33:28 BoogieIcfgContainer [2022-11-18 19:33:28,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:33:28,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:33:28,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:33:28,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:33:28,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:33:27" (1/3) ... [2022-11-18 19:33:28,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b9efc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:33:28, skipping insertion in model container [2022-11-18 19:33:28,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:27" (2/3) ... [2022-11-18 19:33:28,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b9efc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:33:28, skipping insertion in model container [2022-11-18 19:33:28,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:33:28" (3/3) ... [2022-11-18 19:33:28,416 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2022-11-18 19:33:28,437 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:33:28,438 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:33:28,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:33:28,544 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;@7c6fc87d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:33:28,545 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 19:33:28,549 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-18 19:33:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 19:33:28,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:28,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:28,560 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:28,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:28,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2022-11-18 19:33:28,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:28,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650247841] [2022-11-18 19:33:28,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:28,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:28,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:28,916 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-18 19:33:28,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:28,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650247841] [2022-11-18 19:33:28,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650247841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:28,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:28,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:33:28,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193425759] [2022-11-18 19:33:28,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:28,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:33:28,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:28,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:33:28,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:33:28,958 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-18 19:33:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:29,039 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-11-18 19:33:29,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:33:29,042 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-18 19:33:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:29,050 INFO L225 Difference]: With dead ends: 34 [2022-11-18 19:33:29,051 INFO L226 Difference]: Without dead ends: 18 [2022-11-18 19:33:29,054 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-18 19:33:29,058 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.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:29,059 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.1s Time] [2022-11-18 19:33:29,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-18 19:33:29,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-18 19:33:29,099 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-18 19:33:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-18 19:33:29,102 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-11-18 19:33:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:29,102 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-18 19:33:29,103 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-18 19:33:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-18 19:33:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:33:29,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:29,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:29,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:33:29,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:29,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:29,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2022-11-18 19:33:29,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:29,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943682559] [2022-11-18 19:33:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:29,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:29,201 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-18 19:33:29,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:29,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943682559] [2022-11-18 19:33:29,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943682559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:29,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:29,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:33:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966659962] [2022-11-18 19:33:29,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:29,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:33:29,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:29,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:33:29,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:33:29,208 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-18 19:33:29,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:29,238 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-11-18 19:33:29,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:33:29,239 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-18 19:33:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:29,240 INFO L225 Difference]: With dead ends: 24 [2022-11-18 19:33:29,240 INFO L226 Difference]: Without dead ends: 20 [2022-11-18 19:33:29,241 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-18 19:33:29,242 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-18 19:33:29,243 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-18 19:33:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-18 19:33:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-11-18 19:33:29,249 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-18 19:33:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-18 19:33:29,250 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-11-18 19:33:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:29,251 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-18 19:33:29,251 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-18 19:33:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-18 19:33:29,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 19:33:29,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:29,252 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-18 19:33:29,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:33:29,253 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:29,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:29,254 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2022-11-18 19:33:29,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:29,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116820092] [2022-11-18 19:33:29,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:29,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:29,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:29,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:29,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-18 19:33:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:29,522 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-18 19:33:29,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:29,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116820092] [2022-11-18 19:33:29,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116820092] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:29,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599526036] [2022-11-18 19:33:29,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:29,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:29,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:29,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:29,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:33:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:29,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:33:29,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:29,748 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-18 19:33:29,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:29,993 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-18 19:33:29,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599526036] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:29,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:33:29,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-11-18 19:33:29,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362182973] [2022-11-18 19:33:29,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:29,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 19:33:29,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:29,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 19:33:29,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:33:29,997 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-18 19:33:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:30,149 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-11-18 19:33:30,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:33:30,150 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-18 19:33:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:30,152 INFO L225 Difference]: With dead ends: 35 [2022-11-18 19:33:30,154 INFO L226 Difference]: Without dead ends: 20 [2022-11-18 19:33:30,155 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-18 19:33:30,160 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-18 19:33:30,162 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-18 19:33:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-18 19:33:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-18 19:33:30,172 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-18 19:33:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-11-18 19:33:30,176 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2022-11-18 19:33:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:30,177 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-11-18 19:33:30,177 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-18 19:33:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-11-18 19:33:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 19:33:30,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:30,181 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-18 19:33:30,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 19:33:30,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:30,386 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:30,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:30,387 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2022-11-18 19:33:30,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:30,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490440697] [2022-11-18 19:33:30,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:30,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:30,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:30,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:30,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:30,598 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-18 19:33:30,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:30,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490440697] [2022-11-18 19:33:30,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490440697] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:30,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199686271] [2022-11-18 19:33:30,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:30,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:30,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:30,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:30,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:33:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:30,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:33:30,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:30,706 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-18 19:33:30,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:30,906 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-18 19:33:30,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199686271] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:30,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:33:30,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-11-18 19:33:30,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018377993] [2022-11-18 19:33:30,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:30,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 19:33:30,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:30,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 19:33:30,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:33:30,910 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-18 19:33:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:31,047 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-11-18 19:33:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:33:31,048 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-18 19:33:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:31,055 INFO L225 Difference]: With dead ends: 38 [2022-11-18 19:33:31,055 INFO L226 Difference]: Without dead ends: 34 [2022-11-18 19:33:31,057 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-18 19:33:31,064 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-18 19:33:31,065 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-18 19:33:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-18 19:33:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-18 19:33:31,075 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-18 19:33:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-11-18 19:33:31,076 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2022-11-18 19:33:31,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:31,077 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-11-18 19:33:31,077 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-18 19:33:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-11-18 19:33:31,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-18 19:33:31,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:31,083 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-18 19:33:31,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-18 19:33:31,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:31,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2022-11-18 19:33:31,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:31,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80437469] [2022-11-18 19:33:31,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:31,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:31,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:31,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:31,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:31,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:31,596 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-18 19:33:31,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:31,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80437469] [2022-11-18 19:33:31,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80437469] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:31,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291193486] [2022-11-18 19:33:31,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:33:31,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:31,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:31,603 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:31,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:33:31,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:33:31,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:33:31,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 19:33:31,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:31,813 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-18 19:33:31,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:32,238 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-18 19:33:32,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291193486] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:32,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:33:32,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2022-11-18 19:33:32,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462051222] [2022-11-18 19:33:32,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:32,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 19:33:32,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:32,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 19:33:32,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-11-18 19:33:32,241 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-18 19:33:32,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:32,444 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2022-11-18 19:33:32,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 19:33:32,444 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-18 19:33:32,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:32,445 INFO L225 Difference]: With dead ends: 69 [2022-11-18 19:33:32,446 INFO L226 Difference]: Without dead ends: 38 [2022-11-18 19:33:32,446 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-18 19:33:32,447 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.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:32,448 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.1s Time] [2022-11-18 19:33:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-18 19:33:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-18 19:33:32,454 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-18 19:33:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-11-18 19:33:32,455 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-11-18 19:33:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:32,456 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-11-18 19:33:32,456 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-18 19:33:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-11-18 19:33:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-18 19:33:32,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:32,458 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-18 19:33:32,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 19:33:32,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:32,664 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:32,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2022-11-18 19:33:32,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:32,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401925346] [2022-11-18 19:33:32,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:32,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:32,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:32,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:32,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:33,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:33,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:33,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:33,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:33,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:33,080 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-18 19:33:33,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:33,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401925346] [2022-11-18 19:33:33,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401925346] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:33,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915753330] [2022-11-18 19:33:33,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 19:33:33,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:33,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:33,082 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:33,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 19:33:33,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-18 19:33:33,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:33:33,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 19:33:33,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:33,227 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-18 19:33:33,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:33,635 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-18 19:33:33,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915753330] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:33,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:33:33,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 17 [2022-11-18 19:33:33,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654510584] [2022-11-18 19:33:33,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:33,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 19:33:33,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:33,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 19:33:33,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-18 19:33:33,646 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-18 19:33:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:33,801 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2022-11-18 19:33:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 19:33:33,802 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-18 19:33:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:33,811 INFO L225 Difference]: With dead ends: 85 [2022-11-18 19:33:33,811 INFO L226 Difference]: Without dead ends: 50 [2022-11-18 19:33:33,817 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-18 19:33:33,820 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:33,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 67 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:33:33,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-18 19:33:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-11-18 19:33:33,833 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-18 19:33:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-11-18 19:33:33,837 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2022-11-18 19:33:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:33,840 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2022-11-18 19:33:33,840 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-18 19:33:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-11-18 19:33:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-18 19:33:33,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:33,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-18 19:33:33,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 19:33:34,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:34,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:34,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:34,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2022-11-18 19:33:34,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:34,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577180858] [2022-11-18 19:33:34,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:34,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:34,824 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-18 19:33:34,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:34,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577180858] [2022-11-18 19:33:34,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577180858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:34,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451746143] [2022-11-18 19:33:34,825 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 19:33:34,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:34,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:34,827 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:34,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 19:33:34,937 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 19:33:34,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:33:34,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 19:33:34,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:35,055 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-18 19:33:35,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:36,110 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-18 19:33:36,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451746143] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:36,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:33:36,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13] total 20 [2022-11-18 19:33:36,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011576064] [2022-11-18 19:33:36,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:36,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 19:33:36,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:36,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 19:33:36,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2022-11-18 19:33:36,114 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-18 19:33:36,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:36,352 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2022-11-18 19:33:36,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 19:33:36,360 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-18 19:33:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:36,369 INFO L225 Difference]: With dead ends: 117 [2022-11-18 19:33:36,369 INFO L226 Difference]: Without dead ends: 113 [2022-11-18 19:33:36,370 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-18 19:33:36,371 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 132 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:36,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 70 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:33:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-18 19:33:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2022-11-18 19:33:36,407 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-18 19:33:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2022-11-18 19:33:36,411 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2022-11-18 19:33:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:36,411 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2022-11-18 19:33:36,412 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-18 19:33:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2022-11-18 19:33:36,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-11-18 19:33:36,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:36,420 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-18 19:33:36,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-18 19:33:36,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-18 19:33:36,621 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:36,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:36,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2022-11-18 19:33:36,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:36,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210446364] [2022-11-18 19:33:36,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:36,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:36,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-18 19:33:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,838 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-18 19:33:37,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:37,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210446364] [2022-11-18 19:33:37,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210446364] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:37,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765986988] [2022-11-18 19:33:37,839 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 19:33:37,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:37,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:37,841 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:37,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 19:33:37,988 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-11-18 19:33:37,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:33:37,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 19:33:37,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:38,207 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-18 19:33:38,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:40,315 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-18 19:33:40,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765986988] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:40,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:33:40,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 21] total 34 [2022-11-18 19:33:40,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635577976] [2022-11-18 19:33:40,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:40,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-18 19:33:40,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:40,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-18 19:33:40,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2022-11-18 19:33:40,319 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-18 19:33:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:41,000 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2022-11-18 19:33:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-18 19:33:41,004 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-18 19:33:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:41,005 INFO L225 Difference]: With dead ends: 193 [2022-11-18 19:33:41,006 INFO L226 Difference]: Without dead ends: 95 [2022-11-18 19:33:41,007 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-18 19:33:41,008 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 203 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:41,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 172 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 19:33:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-18 19:33:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2022-11-18 19:33:41,027 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-18 19:33:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2022-11-18 19:33:41,029 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2022-11-18 19:33:41,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:41,030 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2022-11-18 19:33:41,030 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-18 19:33:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2022-11-18 19:33:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-11-18 19:33:41,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:41,036 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-18 19:33:41,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 19:33:41,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-18 19:33:41,242 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:41,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 6 times [2022-11-18 19:33:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:41,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421723228] [2022-11-18 19:33:41,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:41,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:41,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-18 19:33:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-18 19:33:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:42,793 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-18 19:33:42,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:42,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421723228] [2022-11-18 19:33:42,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421723228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:42,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686624406] [2022-11-18 19:33:42,794 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 19:33:42,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:42,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:42,796 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:42,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 19:33:42,958 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2022-11-18 19:33:42,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:33:42,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-18 19:33:42,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:43,070 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-18 19:33:43,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:44,777 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-18 19:33:44,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686624406] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:44,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:33:44,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 15] total 25 [2022-11-18 19:33:44,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657962902] [2022-11-18 19:33:44,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:44,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 19:33:44,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 19:33:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2022-11-18 19:33:44,785 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-18 19:33:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:45,073 INFO L93 Difference]: Finished difference Result 266 states and 398 transitions. [2022-11-18 19:33:45,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 19:33:45,074 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-18 19:33:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:45,081 INFO L225 Difference]: With dead ends: 266 [2022-11-18 19:33:45,081 INFO L226 Difference]: Without dead ends: 262 [2022-11-18 19:33:45,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 633 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=437, Unknown=0, NotChecked=0, Total=650 [2022-11-18 19:33:45,084 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 170 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:45,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 102 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:33:45,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-18 19:33:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 247. [2022-11-18 19:33:45,137 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-18 19:33:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 368 transitions. [2022-11-18 19:33:45,144 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 368 transitions. Word has length 283 [2022-11-18 19:33:45,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:45,146 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 368 transitions. [2022-11-18 19:33:45,146 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-18 19:33:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 368 transitions. [2022-11-18 19:33:45,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2022-11-18 19:33:45,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:45,161 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-18 19:33:45,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 19:33:45,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:45,376 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1042599522, now seen corresponding path program 7 times [2022-11-18 19:33:45,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:45,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933250957] [2022-11-18 19:33:45,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:45,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:46,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:46,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-18 19:33:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-18 19:33:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:47,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-18 19:33:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-18 19:33:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-18 19:33:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,649 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-18 19:33:48,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:48,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933250957] [2022-11-18 19:33:48,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933250957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:48,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391366056] [2022-11-18 19:33:48,650 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 19:33:48,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:48,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:48,651 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:48,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 19:33:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:48,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 19:33:48,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:49,107 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-18 19:33:49,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:52,598 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-18 19:33:52,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391366056] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:52,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:33:52,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 12, 19] total 38 [2022-11-18 19:33:52,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572143774] [2022-11-18 19:33:52,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:52,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-18 19:33:52,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:52,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-18 19:33:52,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2022-11-18 19:33:52,603 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-18 19:33:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:53,489 INFO L93 Difference]: Finished difference Result 388 states and 667 transitions. [2022-11-18 19:33:53,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-18 19:33:53,490 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-18 19:33:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:53,494 INFO L225 Difference]: With dead ends: 388 [2022-11-18 19:33:53,494 INFO L226 Difference]: Without dead ends: 152 [2022-11-18 19:33:53,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1266 GetRequests, 1199 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=873, Invalid=2787, Unknown=0, NotChecked=0, Total=3660 [2022-11-18 19:33:53,498 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 223 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:53,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 227 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:33:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-18 19:33:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 122. [2022-11-18 19:33:53,524 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-18 19:33:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2022-11-18 19:33:53,526 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 528 [2022-11-18 19:33:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:53,526 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2022-11-18 19:33:53,527 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-18 19:33:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2022-11-18 19:33:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2022-11-18 19:33:53,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:53,535 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-18 19:33:53,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-18 19:33:53,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 19:33:53,742 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:53,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:53,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1121911956, now seen corresponding path program 8 times [2022-11-18 19:33:53,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:53,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030583482] [2022-11-18 19:33:53,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:53,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:55,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-18 19:33:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-18 19:33:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-18 19:33:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-18 19:33:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-11-18 19:33:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-18 19:33:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-18 19:33:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-18 19:33:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:33:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:33:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:33:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:33:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,584 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-18 19:33:59,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:59,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030583482] [2022-11-18 19:33:59,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030583482] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:59,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141943807] [2022-11-18 19:33:59,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:33:59,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:59,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:59,587 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:59,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 19:34:00,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:34:00,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:34:00,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 19:34:00,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:34:00,239 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-18 19:34:00,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:34:05,421 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-18 19:34:05,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141943807] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:34:05,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:34:05,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 13, 21] total 42 [2022-11-18 19:34:05,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797923061] [2022-11-18 19:34:05,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:34:05,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-18 19:34:05,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:34:05,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-18 19:34:05,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=1306, Unknown=0, NotChecked=0, Total=1722 [2022-11-18 19:34:05,428 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-18 19:34:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:34:06,496 INFO L93 Difference]: Finished difference Result 270 states and 462 transitions. [2022-11-18 19:34:06,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-18 19:34:06,511 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-18 19:34:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:34:06,520 INFO L225 Difference]: With dead ends: 270 [2022-11-18 19:34:06,521 INFO L226 Difference]: Without dead ends: 163 [2022-11-18 19:34:06,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2026 GetRequests, 1949 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1113, Invalid=3579, Unknown=0, NotChecked=0, Total=4692 [2022-11-18 19:34:06,525 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 369 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:34:06,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 222 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:34:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-18 19:34:06,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2022-11-18 19:34:06,538 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-18 19:34:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2022-11-18 19:34:06,541 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 855 [2022-11-18 19:34:06,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:34:06,545 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2022-11-18 19:34:06,545 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-18 19:34:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2022-11-18 19:34:06,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1564 [2022-11-18 19:34:06,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:34:06,587 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-18 19:34:06,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 19:34:06,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:34:06,795 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:34:06,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:34:06,796 INFO L85 PathProgramCache]: Analyzing trace with hash 35450340, now seen corresponding path program 9 times [2022-11-18 19:34:06,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:34:06,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186103382] [2022-11-18 19:34:06,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:34:06,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:34:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:09,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:34:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:12,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:13,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:34:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-18 19:34:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-18 19:34:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:34:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-18 19:34:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:34:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:14,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-18 19:34:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-11-18 19:34:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:34:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-18 19:34:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-18 19:34:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:34:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:15,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2022-11-18 19:34:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:16,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:16,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:34:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-18 19:34:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-18 19:34:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:34:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-18 19:34:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:34:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-18 19:34:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-11-18 19:34:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:34:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-18 19:34:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:17,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 636 [2022-11-18 19:34:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 19:34:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-18 19:34:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 19:34:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:34:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:34:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:34:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,279 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-18 19:34:18,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:34:18,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186103382] [2022-11-18 19:34:18,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186103382] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:34:18,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083096378] [2022-11-18 19:34:18,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 19:34:18,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:34:18,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:34:18,283 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:34:18,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 19:34:19,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 108 check-sat command(s) [2022-11-18 19:34:19,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:34:19,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 19:34:19,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:34:19,500 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-18 19:34:19,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:34:25,506 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-18 19:34:25,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083096378] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:34:25,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:34:25,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14, 21] total 48 [2022-11-18 19:34:25,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207891270] [2022-11-18 19:34:25,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:34:25,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-18 19:34:25,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:34:25,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-18 19:34:25,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=1755, Unknown=0, NotChecked=0, Total=2256 [2022-11-18 19:34:25,512 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-18 19:34:26,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:34:26,793 INFO L93 Difference]: Finished difference Result 319 states and 564 transitions. [2022-11-18 19:34:26,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-18 19:34:26,793 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-18 19:34:26,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:34:26,798 INFO L225 Difference]: With dead ends: 319 [2022-11-18 19:34:26,798 INFO L226 Difference]: Without dead ends: 195 [2022-11-18 19:34:26,801 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-18 19:34:26,802 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 376 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:34:26,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 277 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [619 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 19:34:26,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-18 19:34:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2022-11-18 19:34:26,815 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-18 19:34:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2022-11-18 19:34:26,817 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 1563 [2022-11-18 19:34:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:34:26,819 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2022-11-18 19:34:26,819 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-18 19:34:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2022-11-18 19:34:26,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2022-11-18 19:34:26,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:34:26,832 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-18 19:34:26,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 19:34:27,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:34:27,041 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:34:27,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:34:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 10 times [2022-11-18 19:34:27,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:34:27,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277245830] [2022-11-18 19:34:27,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:34:27,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:34:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:34:27,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:34:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:34:27,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 19:34:27,785 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:34:27,786 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 19:34:27,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 19:34:27,791 INFO L444 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2022-11-18 19:34:27,796 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:34:28,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:34:28 BoogieIcfgContainer [2022-11-18 19:34:28,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:34:28,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:34:28,029 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:34:28,029 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:34:28,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:33:28" (3/4) ... [2022-11-18 19:34:28,032 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 19:34:28,224 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 19:34:28,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:34:28,225 INFO L158 Benchmark]: Toolchain (without parser) took 60491.83ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 941.6MB). Free memory was 87.6MB in the beginning and 881.2MB in the end (delta: -793.6MB). Peak memory consumption was 147.7MB. Max. memory is 16.1GB. [2022-11-18 19:34:28,225 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 123.7MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:34:28,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.26ms. Allocated memory is still 123.7MB. Free memory was 87.4MB in the beginning and 98.9MB in the end (delta: -11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:34:28,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.59ms. Allocated memory is still 123.7MB. Free memory was 98.9MB in the beginning and 97.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:34:28,226 INFO L158 Benchmark]: Boogie Preprocessor took 27.95ms. Allocated memory is still 123.7MB. Free memory was 97.5MB in the beginning and 96.9MB in the end (delta: 568.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:34:28,227 INFO L158 Benchmark]: RCFGBuilder took 341.23ms. Allocated memory is still 123.7MB. Free memory was 96.4MB in the beginning and 86.9MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:34:28,227 INFO L158 Benchmark]: TraceAbstraction took 59623.76ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 941.6MB). Free memory was 86.4MB in the beginning and 906.3MB in the end (delta: -819.9MB). Peak memory consumption was 523.9MB. Max. memory is 16.1GB. [2022-11-18 19:34:28,228 INFO L158 Benchmark]: Witness Printer took 196.02ms. Allocated memory is still 1.1GB. Free memory was 906.3MB in the beginning and 881.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-18 19:34:28,230 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.28ms. Allocated memory is still 123.7MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.26ms. Allocated memory is still 123.7MB. Free memory was 87.4MB in the beginning and 98.9MB in the end (delta: -11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.59ms. Allocated memory is still 123.7MB. Free memory was 98.9MB in the beginning and 97.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.95ms. Allocated memory is still 123.7MB. Free memory was 97.5MB in the beginning and 96.9MB in the end (delta: 568.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 341.23ms. Allocated memory is still 123.7MB. Free memory was 96.4MB in the beginning and 86.9MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 59623.76ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 941.6MB). Free memory was 86.4MB in the beginning and 906.3MB in the end (delta: -819.9MB). Peak memory consumption was 523.9MB. Max. memory is 16.1GB. * Witness Printer took 196.02ms. Allocated memory is still 1.1GB. Free memory was 906.3MB in the beginning and 881.2MB in the end (delta: 25.2MB). 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: 59.3s, OverallIterations: 13, TraceHistogramMax: 229, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.1s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1741 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1671 mSDsluCounter, 1473 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1199 mSDsCounter, 2322 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3190 IncrementalHoareTripleChecker+Invalid, 5512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2322 mSolverCounterUnsat, 274 mSDtfsCounter, 3190 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.6s 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.2s SatisfiabilityAnalysisTime, 47.1s 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-18 19:34:28,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4294f5-d94a-4d88-9b5a-5f23c46e4065/bin/uautomizer-TMbwUNV5ro/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