./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 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS --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-4e7fbc6 [2022-11-23 02:57:53,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:57:53,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:57:53,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:57:53,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:57:53,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:57:53,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:57:53,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:57:53,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:57:53,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:57:53,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:57:53,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:57:53,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:57:53,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:57:53,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:57:53,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:57:53,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:57:53,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:57:53,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:57:53,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:57:53,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:57:53,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:57:53,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:57:53,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:57:53,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:57:53,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:57:53,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:57:53,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:57:53,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:57:53,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:57:53,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:57:53,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:57:53,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:57:53,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:57:53,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:57:53,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:57:53,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:57:53,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:57:53,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:57:53,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:57:53,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:57:53,574 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 02:57:53,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:57:53,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:57:53,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:57:53,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:57:53,601 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:57:53,601 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:57:53,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:57:53,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:57:53,603 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:57:53,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:57:53,603 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:57:53,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:57:53,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:57:53,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:57:53,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 02:57:53,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:57:53,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 02:57:53,605 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:57:53,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 02:57:53,605 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:57:53,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 02:57:53,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:57:53,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:57:53,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:57:53,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:57:53,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:57:53,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:57:53,607 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 02:57:53,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:57:53,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:57:53,607 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:57:53,608 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 02:57:53,608 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:57:53,608 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:57:53,608 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/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_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS 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-23 02:57:54,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:57:54,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:57:54,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:57:54,075 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:57:54,076 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:57:54,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2022-11-23 02:57:57,315 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:57:57,530 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:57:57,530 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2022-11-23 02:57:57,538 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/data/c5ec46ebe/51b02c1da78c4a9082e792cd0fa45270/FLAG0048152ad [2022-11-23 02:57:57,556 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/data/c5ec46ebe/51b02c1da78c4a9082e792cd0fa45270 [2022-11-23 02:57:57,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:57:57,561 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:57:57,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:57:57,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:57:57,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:57:57,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:57:57" (1/1) ... [2022-11-23 02:57:57,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25a0be0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57, skipping insertion in model container [2022-11-23 02:57:57,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:57:57" (1/1) ... [2022-11-23 02:57:57,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:57:57,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:57:57,790 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2022-11-23 02:57:57,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:57:57,815 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:57:57,834 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2022-11-23 02:57:57,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:57:57,852 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:57:57,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57 WrapperNode [2022-11-23 02:57:57,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:57:57,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:57:57,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:57:57,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:57:57,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2022-11-23 02:57:57,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2022-11-23 02:57:57,894 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-11-23 02:57:57,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:57:57,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:57:57,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:57:57,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:57:57,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2022-11-23 02:57:57,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2022-11-23 02:57:57,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2022-11-23 02:57:57,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2022-11-23 02:57:57,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2022-11-23 02:57:57,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2022-11-23 02:57:57,923 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2022-11-23 02:57:57,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2022-11-23 02:57:57,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:57:57,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:57:57,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:57:57,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:57:57,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2022-11-23 02:57:57,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:57:57,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:57:57,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:57:58,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:57:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:57:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:57:58,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:57:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:57:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2022-11-23 02:57:58,022 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2022-11-23 02:57:58,099 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:57:58,102 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:57:58,221 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:57:58,228 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:57:58,229 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 02:57:58,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:57:58 BoogieIcfgContainer [2022-11-23 02:57:58,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:57:58,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:57:58,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:57:58,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:57:58,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:57:57" (1/3) ... [2022-11-23 02:57:58,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b901ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:57:58, skipping insertion in model container [2022-11-23 02:57:58,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (2/3) ... [2022-11-23 02:57:58,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b901ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:57:58, skipping insertion in model container [2022-11-23 02:57:58,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:57:58" (3/3) ... [2022-11-23 02:57:58,249 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2022-11-23 02:57:58,284 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:57:58,285 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 02:57:58,341 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:57:58,348 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;@543e9af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:57:58,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 02:57:58,353 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-23 02:57:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 02:57:58,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:57:58,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:57:58,364 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:57:58,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:57:58,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2022-11-23 02:57:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:57:58,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72217391] [2022-11-23 02:57:58,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:57:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:57:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:57:58,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:57:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:57:58,765 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-23 02:57:58,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:57:58,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72217391] [2022-11-23 02:57:58,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72217391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:57:58,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:57:58,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:57:58,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762924780] [2022-11-23 02:57:58,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:57:58,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:57:58,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:57:58,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:57:58,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:57:58,858 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-23 02:57:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:57:58,928 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-11-23 02:57:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:57:58,931 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-23 02:57:58,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:57:58,957 INFO L225 Difference]: With dead ends: 34 [2022-11-23 02:57:58,957 INFO L226 Difference]: Without dead ends: 18 [2022-11-23 02:57:58,960 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-23 02:57:58,964 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:57:58,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:57:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-23 02:57:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-23 02:57:59,010 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-23 02:57:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-23 02:57:59,013 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-11-23 02:57:59,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:57:59,013 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-23 02:57:59,014 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-23 02:57:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-23 02:57:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 02:57:59,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:57:59,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:57:59,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:57:59,017 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:57:59,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:57:59,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2022-11-23 02:57:59,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:57:59,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114080023] [2022-11-23 02:57:59,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:57:59,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:57:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:57:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:57:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:57:59,155 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-23 02:57:59,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:57:59,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114080023] [2022-11-23 02:57:59,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114080023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:57:59,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:57:59,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:57:59,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622735607] [2022-11-23 02:57:59,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:57:59,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:57:59,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:57:59,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:57:59,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:57:59,161 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-23 02:57:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:57:59,197 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-11-23 02:57:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:57:59,199 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-23 02:57:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:57:59,200 INFO L225 Difference]: With dead ends: 24 [2022-11-23 02:57:59,201 INFO L226 Difference]: Without dead ends: 20 [2022-11-23 02:57:59,201 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-23 02:57:59,203 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-23 02:57:59,204 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-23 02:57:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-23 02:57:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-11-23 02:57:59,211 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-23 02:57:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-23 02:57:59,212 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-11-23 02:57:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:57:59,213 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-23 02:57:59,213 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-23 02:57:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-23 02:57:59,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 02:57:59,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:57:59,215 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-23 02:57:59,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:57:59,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:57:59,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:57:59,217 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2022-11-23 02:57:59,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:57:59,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987203426] [2022-11-23 02:57:59,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:57:59,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:57:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:57:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:57:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:57:59,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:57:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:57:59,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 02:57:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:57:59,492 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-23 02:57:59,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:57:59,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987203426] [2022-11-23 02:57:59,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987203426] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:57:59,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71941627] [2022-11-23 02:57:59,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:57:59,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:57:59,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:57:59,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:57:59,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 02:57:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:57:59,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:57:59,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:57:59,814 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-23 02:57:59,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:58:00,159 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-23 02:58:00,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71941627] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:58:00,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:58:00,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-11-23 02:58:00,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620812139] [2022-11-23 02:58:00,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:58:00,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 02:58:00,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:58:00,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 02:58:00,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-23 02:58:00,174 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-23 02:58:00,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:58:00,316 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-11-23 02:58:00,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 02:58:00,317 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-23 02:58:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:58:00,318 INFO L225 Difference]: With dead ends: 35 [2022-11-23 02:58:00,318 INFO L226 Difference]: Without dead ends: 20 [2022-11-23 02:58:00,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-11-23 02:58:00,320 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-23 02:58:00,321 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-23 02:58:00,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-23 02:58:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-23 02:58:00,327 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-23 02:58:00,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-11-23 02:58:00,329 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2022-11-23 02:58:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:58:00,330 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-11-23 02:58:00,330 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-23 02:58:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-11-23 02:58:00,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 02:58:00,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:58:00,332 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-23 02:58:00,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 02:58:00,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:00,539 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:58:00,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:58:00,540 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2022-11-23 02:58:00,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:58:00,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941782267] [2022-11-23 02:58:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:58:00,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:58:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:00,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:58:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:00,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:00,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:00,870 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-23 02:58:00,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:58:00,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941782267] [2022-11-23 02:58:00,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941782267] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:58:00,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312810075] [2022-11-23 02:58:00,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:58:00,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:00,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:58:00,888 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:58:00,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 02:58:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:00,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:58:00,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:58:00,998 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-23 02:58:00,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:58:01,241 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-23 02:58:01,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312810075] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:58:01,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:58:01,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-11-23 02:58:01,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530815920] [2022-11-23 02:58:01,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:58:01,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 02:58:01,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:58:01,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 02:58:01,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-23 02:58:01,258 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-23 02:58:01,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:58:01,377 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-11-23 02:58:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:58:01,379 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-23 02:58:01,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:58:01,387 INFO L225 Difference]: With dead ends: 38 [2022-11-23 02:58:01,388 INFO L226 Difference]: Without dead ends: 34 [2022-11-23 02:58:01,389 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-23 02:58:01,394 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-23 02:58:01,395 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-23 02:58:01,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-23 02:58:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-23 02:58:01,413 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-23 02:58:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-11-23 02:58:01,418 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2022-11-23 02:58:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:58:01,422 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-11-23 02:58:01,423 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-23 02:58:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-11-23 02:58:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 02:58:01,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:58:01,428 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-23 02:58:01,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 02:58:01,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:01,629 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:58:01,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:58:01,629 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2022-11-23 02:58:01,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:58:01,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266700564] [2022-11-23 02:58:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:58:01,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:58:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:01,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:58:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:01,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:01,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:01,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:01,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:01,849 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-23 02:58:01,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:58:01,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266700564] [2022-11-23 02:58:01,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266700564] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:58:01,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041625461] [2022-11-23 02:58:01,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:58:01,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:01,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:58:01,852 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:58:01,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 02:58:01,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:58:01,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:58:01,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 02:58:01,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:58:02,070 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-23 02:58:02,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:58:02,530 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-23 02:58:02,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041625461] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:58:02,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:58:02,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2022-11-23 02:58:02,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31062384] [2022-11-23 02:58:02,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:58:02,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 02:58:02,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:58:02,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 02:58:02,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-11-23 02:58:02,535 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-23 02:58:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:58:02,772 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2022-11-23 02:58:02,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 02:58:02,773 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-23 02:58:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:58:02,774 INFO L225 Difference]: With dead ends: 69 [2022-11-23 02:58:02,775 INFO L226 Difference]: Without dead ends: 38 [2022-11-23 02:58:02,776 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-23 02:58:02,777 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-23 02:58:02,777 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-23 02:58:02,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-23 02:58:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-23 02:58:02,785 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-23 02:58:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-11-23 02:58:02,786 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-11-23 02:58:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:58:02,787 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-11-23 02:58:02,787 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-23 02:58:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-11-23 02:58:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-23 02:58:02,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:58:02,790 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-23 02:58:02,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 02:58:03,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:03,005 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:58:03,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:58:03,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2022-11-23 02:58:03,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:58:03,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197649037] [2022-11-23 02:58:03,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:58:03,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:58:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:03,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:58:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:03,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:03,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:03,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:03,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:03,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:03,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:03,488 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-23 02:58:03,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:58:03,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197649037] [2022-11-23 02:58:03,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197649037] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:58:03,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389881297] [2022-11-23 02:58:03,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:58:03,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:03,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:58:03,491 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:58:03,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 02:58:03,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-23 02:58:03,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:58:03,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 02:58:03,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:58:03,653 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-23 02:58:03,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:58:04,075 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-23 02:58:04,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389881297] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:58:04,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:58:04,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 17 [2022-11-23 02:58:04,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843328890] [2022-11-23 02:58:04,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:58:04,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 02:58:04,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:58:04,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 02:58:04,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-23 02:58:04,078 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-23 02:58:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:58:04,290 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2022-11-23 02:58:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 02:58:04,291 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-23 02:58:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:58:04,298 INFO L225 Difference]: With dead ends: 85 [2022-11-23 02:58:04,298 INFO L226 Difference]: Without dead ends: 50 [2022-11-23 02:58:04,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2022-11-23 02:58:04,307 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.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:58:04,307 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.2s Time] [2022-11-23 02:58:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-23 02:58:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-11-23 02:58:04,332 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-23 02:58:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-11-23 02:58:04,336 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2022-11-23 02:58:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:58:04,339 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2022-11-23 02:58:04,339 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-23 02:58:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-11-23 02:58:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-23 02:58:04,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:58:04,349 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-23 02:58:04,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 02:58:04,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:04,555 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:58:04,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:58:04,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2022-11-23 02:58:04,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:58:04,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953366081] [2022-11-23 02:58:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:58:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:58:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:04,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:58:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:04,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:05,365 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-23 02:58:05,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:58:05,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953366081] [2022-11-23 02:58:05,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953366081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:58:05,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769468326] [2022-11-23 02:58:05,367 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 02:58:05,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:05,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:58:05,371 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:58:05,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 02:58:05,479 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 02:58:05,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:58:05,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 02:58:05,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:58:05,600 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-23 02:58:05,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:58:06,750 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-23 02:58:06,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769468326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:58:06,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:58:06,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13] total 20 [2022-11-23 02:58:06,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571902370] [2022-11-23 02:58:06,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:58:06,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 02:58:06,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:58:06,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 02:58:06,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2022-11-23 02:58:06,754 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-23 02:58:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:58:07,024 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2022-11-23 02:58:07,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 02:58:07,025 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-23 02:58:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:58:07,032 INFO L225 Difference]: With dead ends: 117 [2022-11-23 02:58:07,033 INFO L226 Difference]: Without dead ends: 113 [2022-11-23 02:58:07,033 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-23 02:58:07,034 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-23 02:58:07,035 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-23 02:58:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-23 02:58:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2022-11-23 02:58:07,064 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-23 02:58:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2022-11-23 02:58:07,072 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2022-11-23 02:58:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:58:07,075 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2022-11-23 02:58:07,075 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-23 02:58:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2022-11-23 02:58:07,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-11-23 02:58:07,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:58:07,090 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-23 02:58:07,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 02:58:07,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:07,298 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:58:07,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:58:07,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2022-11-23 02:58:07,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:58:07,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577103387] [2022-11-23 02:58:07,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:58:07,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:58:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:58:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:07,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 02:58:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:08,675 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-23 02:58:08,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:58:08,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577103387] [2022-11-23 02:58:08,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577103387] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:58:08,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506964066] [2022-11-23 02:58:08,676 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 02:58:08,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:08,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:58:08,677 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:58:08,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 02:58:08,840 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-11-23 02:58:08,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:58:08,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-23 02:58:08,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:58:09,079 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-23 02:58:09,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:58:11,445 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-23 02:58:11,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506964066] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:58:11,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:58:11,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 21] total 34 [2022-11-23 02:58:11,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154020404] [2022-11-23 02:58:11,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:58:11,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-23 02:58:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:58:11,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-23 02:58:11,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2022-11-23 02:58:11,449 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-23 02:58:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:58:12,137 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2022-11-23 02:58:12,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-23 02:58:12,139 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-23 02:58:12,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:58:12,143 INFO L225 Difference]: With dead ends: 193 [2022-11-23 02:58:12,143 INFO L226 Difference]: Without dead ends: 95 [2022-11-23 02:58:12,145 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-23 02:58:12,147 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 203 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 02:58:12,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 172 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 02:58:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-23 02:58:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2022-11-23 02:58:12,168 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-23 02:58:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2022-11-23 02:58:12,170 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2022-11-23 02:58:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:58:12,171 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2022-11-23 02:58:12,171 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-23 02:58:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2022-11-23 02:58:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-11-23 02:58:12,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:58:12,176 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-23 02:58:12,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 02:58:12,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:12,384 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:58:12,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:58:12,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 6 times [2022-11-23 02:58:12,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:58:12,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648149336] [2022-11-23 02:58:12,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:58:12,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:58:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:12,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:58:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 02:58:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-23 02:58:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:13,852 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-23 02:58:13,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:58:13,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648149336] [2022-11-23 02:58:13,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648149336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:58:13,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885044536] [2022-11-23 02:58:13,854 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-23 02:58:13,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:13,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:58:13,855 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:58:13,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 02:58:14,026 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2022-11-23 02:58:14,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:58:14,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 02:58:14,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:58:14,149 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-23 02:58:14,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:58:16,010 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-23 02:58:16,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885044536] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:58:16,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:58:16,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 15] total 25 [2022-11-23 02:58:16,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051153707] [2022-11-23 02:58:16,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:58:16,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 02:58:16,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:58:16,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 02:58:16,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2022-11-23 02:58:16,018 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-23 02:58:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:58:16,347 INFO L93 Difference]: Finished difference Result 266 states and 398 transitions. [2022-11-23 02:58:16,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 02:58:16,348 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-23 02:58:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:58:16,352 INFO L225 Difference]: With dead ends: 266 [2022-11-23 02:58:16,353 INFO L226 Difference]: Without dead ends: 262 [2022-11-23 02:58:16,354 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-23 02:58:16,354 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 170 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:58:16,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 102 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 02:58:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-23 02:58:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 247. [2022-11-23 02:58:16,404 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-23 02:58:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 368 transitions. [2022-11-23 02:58:16,413 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 368 transitions. Word has length 283 [2022-11-23 02:58:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:58:16,414 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 368 transitions. [2022-11-23 02:58:16,415 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-23 02:58:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 368 transitions. [2022-11-23 02:58:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2022-11-23 02:58:16,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:58:16,431 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-23 02:58:16,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 02:58:16,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-23 02:58:16,670 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:58:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:58:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1042599522, now seen corresponding path program 7 times [2022-11-23 02:58:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:58:16,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025110051] [2022-11-23 02:58:16,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:58:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:58:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:17,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:58:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:18,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:18,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 02:58:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-23 02:58:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-23 02:58:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:19,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 02:58:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-23 02:58:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,529 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-23 02:58:20,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:58:20,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025110051] [2022-11-23 02:58:20,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025110051] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:58:20,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270541437] [2022-11-23 02:58:20,530 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 02:58:20,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:20,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:58:20,532 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:58:20,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 02:58:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:20,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 02:58:20,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:58:21,125 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-23 02:58:21,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:58:25,086 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-23 02:58:25,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270541437] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:58:25,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:58:25,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 12, 19] total 38 [2022-11-23 02:58:25,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740972698] [2022-11-23 02:58:25,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:58:25,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 02:58:25,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:58:25,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 02:58:25,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 02:58:25,090 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-23 02:58:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:58:26,093 INFO L93 Difference]: Finished difference Result 388 states and 667 transitions. [2022-11-23 02:58:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-23 02:58:26,094 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-23 02:58:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:58:26,097 INFO L225 Difference]: With dead ends: 388 [2022-11-23 02:58:26,098 INFO L226 Difference]: Without dead ends: 152 [2022-11-23 02:58:26,101 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-23 02:58:26,102 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 223 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 02:58:26,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 227 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 02:58:26,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-23 02:58:26,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 122. [2022-11-23 02:58:26,114 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-23 02:58:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2022-11-23 02:58:26,116 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 528 [2022-11-23 02:58:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:58:26,116 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2022-11-23 02:58:26,117 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-23 02:58:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2022-11-23 02:58:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2022-11-23 02:58:26,144 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:58:26,145 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-23 02:58:26,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 02:58:26,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 02:58:26,358 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:58:26,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:58:26,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1121911956, now seen corresponding path program 8 times [2022-11-23 02:58:26,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:58:26,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222967854] [2022-11-23 02:58:26,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:58:26,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:58:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:28,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:58:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:29,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:30,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:30,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:30,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:30,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:30,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:30,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:30,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 02:58:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-23 02:58:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-23 02:58:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 02:58:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-11-23 02:58:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:31,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 02:58:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-23 02:58:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-23 02:58:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:32,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:33,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:33,015 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-23 02:58:33,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:58:33,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222967854] [2022-11-23 02:58:33,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222967854] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:58:33,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321036071] [2022-11-23 02:58:33,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:58:33,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:33,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:58:33,019 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:58:33,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 02:58:33,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:58:33,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:58:33,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-23 02:58:33,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:58:33,734 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-23 02:58:33,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:58:39,083 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-23 02:58:39,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321036071] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:58:39,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:58:39,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 13, 21] total 42 [2022-11-23 02:58:39,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110313782] [2022-11-23 02:58:39,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:58:39,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-23 02:58:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:58:39,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-23 02:58:39,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=1306, Unknown=0, NotChecked=0, Total=1722 [2022-11-23 02:58:39,089 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-23 02:58:40,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:58:40,246 INFO L93 Difference]: Finished difference Result 270 states and 462 transitions. [2022-11-23 02:58:40,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-23 02:58:40,249 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-23 02:58:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:58:40,252 INFO L225 Difference]: With dead ends: 270 [2022-11-23 02:58:40,259 INFO L226 Difference]: Without dead ends: 163 [2022-11-23 02:58:40,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2026 GetRequests, 1949 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1113, Invalid=3579, Unknown=0, NotChecked=0, Total=4692 [2022-11-23 02:58:40,263 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 369 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-11-23 02:58:40,264 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.7s Time] [2022-11-23 02:58:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-23 02:58:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2022-11-23 02:58:40,276 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-23 02:58:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2022-11-23 02:58:40,280 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 855 [2022-11-23 02:58:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:58:40,283 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2022-11-23 02:58:40,284 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-23 02:58:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2022-11-23 02:58:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1564 [2022-11-23 02:58:40,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:58:40,387 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-23 02:58:40,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 02:58:40,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-23 02:58:40,595 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:58:40,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:58:40,596 INFO L85 PathProgramCache]: Analyzing trace with hash 35450340, now seen corresponding path program 9 times [2022-11-23 02:58:40,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:58:40,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304694686] [2022-11-23 02:58:40,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:58:40,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:58:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:44,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:58:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:47,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:47,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 02:58:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-23 02:58:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:48,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-23 02:58:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 02:58:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-11-23 02:58:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 02:58:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-23 02:58:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:49,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2022-11-23 02:58:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:50,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:50,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:50,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:50,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 02:58:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-23 02:58:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-23 02:58:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 02:58:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-11-23 02:58:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 02:58:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 636 [2022-11-23 02:58:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 02:58:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 02:58:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:58:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-23 02:58:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:58:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:58:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:58:51,923 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-23 02:58:51,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:58:51,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304694686] [2022-11-23 02:58:51,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304694686] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:58:51,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234967808] [2022-11-23 02:58:51,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:58:51,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:58:51,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:58:51,927 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:58:51,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 02:58:52,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 108 check-sat command(s) [2022-11-23 02:58:52,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:58:52,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-23 02:58:52,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:58:53,167 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-23 02:58:53,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:58:59,021 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-23 02:58:59,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234967808] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:58:59,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:58:59,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14, 21] total 48 [2022-11-23 02:58:59,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67124866] [2022-11-23 02:58:59,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:58:59,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-23 02:58:59,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:58:59,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-23 02:58:59,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=1755, Unknown=0, NotChecked=0, Total=2256 [2022-11-23 02:58:59,029 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-23 02:59:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:59:00,332 INFO L93 Difference]: Finished difference Result 319 states and 564 transitions. [2022-11-23 02:59:00,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-23 02:59:00,332 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-23 02:59:00,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:59:00,337 INFO L225 Difference]: With dead ends: 319 [2022-11-23 02:59:00,337 INFO L226 Difference]: Without dead ends: 195 [2022-11-23 02:59:00,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3665 GetRequests, 3574 SyntacticMatches, 10 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2398 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1446, Invalid=5360, Unknown=0, NotChecked=0, Total=6806 [2022-11-23 02:59:00,341 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 376 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 629 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 02:59:00,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 277 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 02:59:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-23 02:59:00,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2022-11-23 02:59:00,355 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-23 02:59:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2022-11-23 02:59:00,357 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 1563 [2022-11-23 02:59:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:59:00,358 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2022-11-23 02:59:00,359 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-23 02:59:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2022-11-23 02:59:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2022-11-23 02:59:00,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:59:00,372 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-23 02:59:00,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 02:59:00,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 02:59:00,581 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:59:00,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:59:00,581 INFO L85 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 10 times [2022-11-23 02:59:00,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:59:00,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261411071] [2022-11-23 02:59:00,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:59:00,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:59:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:59:00,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:59:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:59:01,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:59:01,233 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:59:01,234 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 02:59:01,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 02:59:01,239 INFO L444 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2022-11-23 02:59:01,245 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:59:01,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:59:01 BoogieIcfgContainer [2022-11-23 02:59:01,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:59:01,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:59:01,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:59:01,465 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:59:01,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:57:58" (3/4) ... [2022-11-23 02:59:01,468 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 02:59:01,693 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 02:59:01,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:59:01,694 INFO L158 Benchmark]: Toolchain (without parser) took 64133.59ms. Allocated memory was 146.8MB in the beginning and 937.4MB in the end (delta: 790.6MB). Free memory was 105.0MB in the beginning and 356.5MB in the end (delta: -251.5MB). Peak memory consumption was 540.5MB. Max. memory is 16.1GB. [2022-11-23 02:59:01,694 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:59:01,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.31ms. Allocated memory is still 146.8MB. Free memory was 104.6MB in the beginning and 94.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 02:59:01,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.40ms. Allocated memory is still 146.8MB. Free memory was 94.6MB in the beginning and 93.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:59:01,695 INFO L158 Benchmark]: Boogie Preprocessor took 33.54ms. Allocated memory is still 146.8MB. Free memory was 93.3MB in the beginning and 92.4MB in the end (delta: 940.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:59:01,696 INFO L158 Benchmark]: RCFGBuilder took 302.24ms. Allocated memory is still 146.8MB. Free memory was 92.4MB in the beginning and 82.9MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 02:59:01,697 INFO L158 Benchmark]: TraceAbstraction took 63229.92ms. Allocated memory was 146.8MB in the beginning and 937.4MB in the end (delta: 790.6MB). Free memory was 82.0MB in the beginning and 381.7MB in the end (delta: -299.7MB). Peak memory consumption was 492.3MB. Max. memory is 16.1GB. [2022-11-23 02:59:01,697 INFO L158 Benchmark]: Witness Printer took 228.41ms. Allocated memory is still 937.4MB. Free memory was 381.7MB in the beginning and 356.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-23 02:59:01,699 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.30ms. Allocated memory is still 109.1MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.31ms. Allocated memory is still 146.8MB. Free memory was 104.6MB in the beginning and 94.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.40ms. Allocated memory is still 146.8MB. Free memory was 94.6MB in the beginning and 93.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.54ms. Allocated memory is still 146.8MB. Free memory was 93.3MB in the beginning and 92.4MB in the end (delta: 940.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 302.24ms. Allocated memory is still 146.8MB. Free memory was 92.4MB in the beginning and 82.9MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 63229.92ms. Allocated memory was 146.8MB in the beginning and 937.4MB in the end (delta: 790.6MB). Free memory was 82.0MB in the beginning and 381.7MB in the end (delta: -299.7MB). Peak memory consumption was 492.3MB. Max. memory is 16.1GB. * Witness Printer took 228.41ms. Allocated memory is still 937.4MB. Free memory was 381.7MB in the beginning and 356.5MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 [unknown-#in~n-unknown=10] [L8] COND FALSE !(n < 1) VAL [n=10, unknown-#in~n-unknown=10] [L10] COND FALSE !(n == 1) VAL [n=10, unknown-#in~n-unknown=10] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=9] [L8] COND FALSE !(n < 1) VAL [n=9, unknown-#in~n-unknown=9] [L10] COND FALSE !(n == 1) VAL [n=9, unknown-#in~n-unknown=9] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=8] [L8] COND FALSE !(n < 1) VAL [n=8, unknown-#in~n-unknown=8] [L10] COND FALSE !(n == 1) VAL [n=8, unknown-#in~n-unknown=8] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=7] [L8] COND FALSE !(n < 1) VAL [n=7, unknown-#in~n-unknown=7] [L10] COND FALSE !(n == 1) VAL [n=7, unknown-#in~n-unknown=7] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=6] [L8] COND FALSE !(n < 1) VAL [n=6, unknown-#in~n-unknown=6] [L10] COND FALSE !(n == 1) VAL [n=6, unknown-#in~n-unknown=6] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=5] [L8] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L10] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=4] [L8] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L10] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=2, n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=2, fibo(n-2)=1, n=4, unknown-#in~n-unknown=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=3, n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=3, fibo(n-2)=2, n=5, unknown-#in~n-unknown=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=5, n=6, unknown-#in~n-unknown=6] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=4] [L8] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L10] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=2, n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=2, fibo(n-2)=1, n=4, unknown-#in~n-unknown=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=5, fibo(n-2)=3, n=6, unknown-#in~n-unknown=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=8, n=7, unknown-#in~n-unknown=7] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=5] [L8] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L10] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=4] [L8] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L10] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=2, n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=2, fibo(n-2)=1, n=4, unknown-#in~n-unknown=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=3, n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=3, fibo(n-2)=2, n=5, unknown-#in~n-unknown=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=8, fibo(n-2)=5, n=7, unknown-#in~n-unknown=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=13, n=8, unknown-#in~n-unknown=8] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=6] [L8] COND FALSE !(n < 1) VAL [n=6, unknown-#in~n-unknown=6] [L10] COND FALSE !(n == 1) VAL [n=6, unknown-#in~n-unknown=6] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=5] [L8] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L10] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=4] [L8] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L10] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=2, n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=2, fibo(n-2)=1, n=4, unknown-#in~n-unknown=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=3, n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=3, fibo(n-2)=2, n=5, unknown-#in~n-unknown=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=5, n=6, unknown-#in~n-unknown=6] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=4] [L8] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L10] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=2, n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=2, fibo(n-2)=1, n=4, unknown-#in~n-unknown=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=5, fibo(n-2)=3, n=6, unknown-#in~n-unknown=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=13, fibo(n-2)=8, n=8, unknown-#in~n-unknown=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=21, n=9, unknown-#in~n-unknown=9] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=7] [L8] COND FALSE !(n < 1) VAL [n=7, unknown-#in~n-unknown=7] [L10] COND FALSE !(n == 1) VAL [n=7, unknown-#in~n-unknown=7] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=6] [L8] COND FALSE !(n < 1) VAL [n=6, unknown-#in~n-unknown=6] [L10] COND FALSE !(n == 1) VAL [n=6, unknown-#in~n-unknown=6] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=5] [L8] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L10] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=4] [L8] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L10] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=2, n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=2, fibo(n-2)=1, n=4, unknown-#in~n-unknown=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=3, n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=3, fibo(n-2)=2, n=5, unknown-#in~n-unknown=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=5, n=6, unknown-#in~n-unknown=6] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=4] [L8] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L10] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=2, n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=2, fibo(n-2)=1, n=4, unknown-#in~n-unknown=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=5, fibo(n-2)=3, n=6, unknown-#in~n-unknown=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=8, n=7, unknown-#in~n-unknown=7] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=5] [L8] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L10] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=4] [L8] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L10] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=2, n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=2, fibo(n-2)=1, n=4, unknown-#in~n-unknown=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=3, n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=3, fibo(n-2)=2, n=5, unknown-#in~n-unknown=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=8, fibo(n-2)=5, n=7, unknown-#in~n-unknown=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=21, fibo(n-2)=13, n=9, unknown-#in~n-unknown=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=34, n=10, unknown-#in~n-unknown=10] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=8] [L8] COND FALSE !(n < 1) VAL [n=8, unknown-#in~n-unknown=8] [L10] COND FALSE !(n == 1) VAL [n=8, unknown-#in~n-unknown=8] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=7] [L8] COND FALSE !(n < 1) VAL [n=7, unknown-#in~n-unknown=7] [L10] COND FALSE !(n == 1) VAL [n=7, unknown-#in~n-unknown=7] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=6] [L8] COND FALSE !(n < 1) VAL [n=6, unknown-#in~n-unknown=6] [L10] COND FALSE !(n == 1) VAL [n=6, unknown-#in~n-unknown=6] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=5] [L8] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L10] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=4] [L8] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L10] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=2, n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=2, fibo(n-2)=1, n=4, unknown-#in~n-unknown=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=3, n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=3, fibo(n-2)=2, n=5, unknown-#in~n-unknown=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=5, n=6, unknown-#in~n-unknown=6] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=4] [L8] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L10] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=2, n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=2, fibo(n-2)=1, n=4, unknown-#in~n-unknown=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=5, fibo(n-2)=3, n=6, unknown-#in~n-unknown=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=8, n=7, unknown-#in~n-unknown=7] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=5] [L8] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L10] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=4] [L8] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L10] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=2, n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=2, fibo(n-2)=1, n=4, unknown-#in~n-unknown=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=3, n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=3, fibo(n-2)=2, n=5, unknown-#in~n-unknown=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=8, fibo(n-2)=5, n=7, unknown-#in~n-unknown=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=13, n=8, unknown-#in~n-unknown=8] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=6] [L8] COND FALSE !(n < 1) VAL [n=6, unknown-#in~n-unknown=6] [L10] COND FALSE !(n == 1) VAL [n=6, unknown-#in~n-unknown=6] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=5] [L8] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L10] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=4] [L8] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L10] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=2, n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=2, fibo(n-2)=1, n=4, unknown-#in~n-unknown=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=3, n=5, unknown-#in~n-unknown=5] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=3, fibo(n-2)=2, n=5, unknown-#in~n-unknown=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=5, n=6, unknown-#in~n-unknown=6] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=4] [L8] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L10] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=3] [L8] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L10] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=3, unknown-#in~n-unknown=3] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=1, n=3, unknown-#in~n-unknown=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=2, n=4, unknown-#in~n-unknown=4] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=2] [L8] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L10] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-1) VAL [unknown-#in~n-unknown=1] [L8] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L13] RET, EXPR fibo(n-1) VAL [fibo(n-1)=1, n=2, unknown-#in~n-unknown=2] [L13] CALL, EXPR fibo(n-2) VAL [unknown-#in~n-unknown=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=1, fibo(n-2)=0, n=2, unknown-#in~n-unknown=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=2, fibo(n-2)=1, n=4, unknown-#in~n-unknown=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=5, fibo(n-2)=3, n=6, unknown-#in~n-unknown=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=13, fibo(n-2)=8, n=8, unknown-#in~n-unknown=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [fibo(n-1)=34, fibo(n-2)=21, n=10, unknown-#in~n-unknown=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: 62.9s, OverallIterations: 13, TraceHistogramMax: 229, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.2s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1741 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1671 mSDsluCounter, 1473 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1199 mSDsCounter, 2328 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3168 IncrementalHoareTripleChecker+Invalid, 5496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2328 mSolverCounterUnsat, 274 mSDtfsCounter, 3168 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.9s 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.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 132 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 49.9s 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-23 02:59:01,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01073970-ff37-4dc0-806e-f2304241c344/bin/uautomizer-QkZJyEgLgS/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